java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:39:46,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:39:46,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:39:46,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:39:46,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:39:46,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:39:46,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:39:46,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:39:46,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:39:46,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:39:46,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:39:46,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:39:46,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:39:46,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:39:46,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:39:46,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:39:46,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:39:46,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:39:46,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:39:46,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:39:46,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:39:46,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:39:46,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:39:46,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:39:46,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:39:46,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:39:46,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:39:46,245 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:39:46,246 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:39:46,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:39:46,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:39:46,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:39:46,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:39:46,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:39:46,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:39:46,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:39:46,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:39:46,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:39:46,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:39:46,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:39:46,292 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:39:46,292 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:39:46,292 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:39:46,295 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:39:46,295 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:39:46,295 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:39:46,295 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:39:46,296 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:39:46,296 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:39:46,297 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:39:46,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:39:46,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:39:46,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:39:46,298 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:39:46,298 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:39:46,298 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:39:46,298 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:39:46,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:39:46,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:39:46,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:39:46,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:39:46,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:39:46,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:39:46,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:39:46,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:39:46,302 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:39:46,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:39:46,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:39:46,303 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:39:46,304 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:39:46,304 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:39:46,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:39:46,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:39:46,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:39:46,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:39:46,400 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:39:46,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-07 16:39:46,457 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/580674c33/f514ec5d4d904da6bce7854a4bf3a809/FLAGe90602954 [2018-11-07 16:39:46,918 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:39:46,919 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-07 16:39:46,930 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/580674c33/f514ec5d4d904da6bce7854a4bf3a809/FLAGe90602954 [2018-11-07 16:39:46,948 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/580674c33/f514ec5d4d904da6bce7854a4bf3a809 [2018-11-07 16:39:46,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:39:46,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:39:46,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:39:46,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:39:46,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:39:46,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:39:46" (1/1) ... [2018-11-07 16:39:46,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e69057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:46, skipping insertion in model container [2018-11-07 16:39:46,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:39:46" (1/1) ... [2018-11-07 16:39:46,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:39:47,001 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:39:47,245 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:39:47,249 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:39:47,269 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:39:47,285 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:39:47,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47 WrapperNode [2018-11-07 16:39:47,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:39:47,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:39:47,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:39:47,287 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:39:47,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:39:47,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:39:47,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:39:47,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:39:47,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (1/1) ... [2018-11-07 16:39:47,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:39:47,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:39:47,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:39:47,330 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:39:47,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (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 [2018-11-07 16:39:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:39:47,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:39:47,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:39:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:39:47,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:39:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:39:47,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:39:47,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:39:47,670 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:39:47,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:39:47 BoogieIcfgContainer [2018-11-07 16:39:47,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:39:47,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:39:47,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:39:47,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:39:47,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:39:46" (1/3) ... [2018-11-07 16:39:47,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b429fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:39:47, skipping insertion in model container [2018-11-07 16:39:47,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:39:47" (2/3) ... [2018-11-07 16:39:47,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b429fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:39:47, skipping insertion in model container [2018-11-07 16:39:47,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:39:47" (3/3) ... [2018-11-07 16:39:47,679 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i [2018-11-07 16:39:47,688 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:39:47,695 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:39:47,710 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:39:47,745 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:39:47,745 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:39:47,745 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:39:47,745 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:39:47,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:39:47,746 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:39:47,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:39:47,746 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:39:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-07 16:39:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:39:47,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:47,771 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:47,773 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:47,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-07 16:39:47,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:47,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:47,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:47,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:47,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:39:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:39:47,887 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:47,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:39:47,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:39:47,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:39:47,907 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-07 16:39:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:47,927 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 16:39:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:39:47,929 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:39:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:47,937 INFO L225 Difference]: With dead ends: 30 [2018-11-07 16:39:47,937 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 16:39:47,941 INFO L604 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 [2018-11-07 16:39:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 16:39:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 16:39:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 16:39:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 16:39:47,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 16:39:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:47,980 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 16:39:47,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:39:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 16:39:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:39:47,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:47,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:47,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:47,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-07 16:39:47,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:47,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:47,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:48,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:39:48,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:39:48,180 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:48,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:39:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:39:48,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:39:48,183 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 16:39:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:48,245 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-07 16:39:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:39:48,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:39:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:48,248 INFO L225 Difference]: With dead ends: 21 [2018-11-07 16:39:48,248 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 16:39:48,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:39:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 16:39:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-07 16:39:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-07 16:39:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-07 16:39:48,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-07 16:39:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:48,256 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-07 16:39:48,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:39:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-07 16:39:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 16:39:48,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:48,257 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:48,258 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:48,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-07 16:39:48,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:48,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:48,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:48,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:48,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:48,408 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:48,412 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 16:39:48,414 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 16:39:48,457 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:39:48,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:39:48,606 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:39:49,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:39:49,078 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 26 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 16:39:49,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:49,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:39:49,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:49,126 INFO L194 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 [2018-11-07 16:39:49,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:49,142 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:39:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:49,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:49,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:49,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:39:49,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:39:49,424 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:39:49,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:39:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:39:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:49,425 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2018-11-07 16:39:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:49,530 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-07 16:39:49,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:39:49,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 16:39:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:49,532 INFO L225 Difference]: With dead ends: 24 [2018-11-07 16:39:49,532 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 16:39:49,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 16:39:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-07 16:39:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 16:39:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-07 16:39:49,537 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-07 16:39:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:49,538 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-07 16:39:49,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:39:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-07 16:39:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 16:39:49,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:49,539 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:49,539 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:49,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:49,540 INFO L82 PathProgramCache]: Analyzing trace with hash -281914435, now seen corresponding path program 1 times [2018-11-07 16:39:49,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:49,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:49,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:49,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:49,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:49,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:49,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:49,695 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 16:39:49,695 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 16:39:49,697 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:39:49,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:39:49,701 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:39:50,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:39:50,159 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 26 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-07 16:39:50,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:50,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:39:50,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:50,198 INFO L194 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 [2018-11-07 16:39:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:50,218 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:39:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:50,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:50,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:39:50,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:39:50,610 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:39:50,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:39:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:39:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:50,611 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2018-11-07 16:39:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:50,872 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-07 16:39:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:39:50,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 16:39:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:50,875 INFO L225 Difference]: With dead ends: 26 [2018-11-07 16:39:50,875 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 16:39:50,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 16:39:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-07 16:39:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 16:39:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-07 16:39:50,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-07 16:39:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:50,884 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-07 16:39:50,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:39:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-07 16:39:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:39:50,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:50,885 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:50,887 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:50,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:50,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-07 16:39:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:50,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:50,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:50,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:51,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:51,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:51,375 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:39:51,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:39:51,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:51,376 INFO L194 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 [2018-11-07 16:39:51,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:39:51,394 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:39:51,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:39:51,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:39:51,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:51,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:51,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:39:51,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:39:51,624 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:39:51,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:39:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:39:51,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:39:51,625 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2018-11-07 16:39:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:51,725 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-07 16:39:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:39:51,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 16:39:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:51,727 INFO L225 Difference]: With dead ends: 29 [2018-11-07 16:39:51,728 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 16:39:51,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:39:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 16:39:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-07 16:39:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 16:39:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-07 16:39:51,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2018-11-07 16:39:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:51,734 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-07 16:39:51,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:39:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-07 16:39:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:39:51,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:51,735 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:51,736 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:51,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash -849134272, now seen corresponding path program 1 times [2018-11-07 16:39:51,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:51,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:39:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:51,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:51,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:51,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:51,915 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 16:39:51,915 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 16:39:51,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:39:51,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:39:51,928 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:39:52,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:39:52,280 INFO L272 AbstractInterpreter]: Visited 14 different actions 69 times. Merged at 5 different actions 26 times. Widened at 1 different actions 3 times. Found 9 fixpoints after 2 different actions. Largest state had 4 variables. [2018-11-07 16:39:52,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:52,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:39:52,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:52,315 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:39:52,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:52,335 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:39:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:52,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:52,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:52,510 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:39:52,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-11-07 16:39:52,510 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:52,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:39:52,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:39:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:52,511 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2018-11-07 16:39:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:52,537 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-07 16:39:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:39:52,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 16:39:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:52,540 INFO L225 Difference]: With dead ends: 35 [2018-11-07 16:39:52,540 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 16:39:52,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 16:39:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-07 16:39:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:39:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-07 16:39:52,547 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-07 16:39:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:52,548 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-07 16:39:52,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:39:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-07 16:39:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:39:52,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:52,549 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:52,549 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:52,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1277798652, now seen corresponding path program 2 times [2018-11-07 16:39:52,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:52,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:52,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:52,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:52,672 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:39:52,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:39:52,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:52,672 INFO L194 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 [2018-11-07 16:39:52,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:39:52,683 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:39:52,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:39:52,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:39:52,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:52,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:52,892 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:39:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-11-07 16:39:52,892 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:39:52,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:39:52,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:39:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:52,893 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 3 states. [2018-11-07 16:39:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:52,916 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-07 16:39:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:39:52,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 16:39:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:52,917 INFO L225 Difference]: With dead ends: 35 [2018-11-07 16:39:52,917 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 16:39:52,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:39:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 16:39:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-07 16:39:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:39:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-07 16:39:52,927 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-11-07 16:39:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:52,930 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-07 16:39:52,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:39:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-07 16:39:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:39:52,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:52,931 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:52,931 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:52,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:52,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1242161282, now seen corresponding path program 2 times [2018-11-07 16:39:52,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:52,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:52,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:39:52,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:52,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:53,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:53,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:53,110 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:39:53,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:39:53,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:53,111 INFO L194 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:39:53,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:39:53,122 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:05,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:40:05,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:05,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:05,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:05,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:05,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:40:05,594 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:05,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:40:05,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:40:05,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:40:05,595 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-07 16:40:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:05,702 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-07 16:40:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:40:05,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 16:40:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:05,704 INFO L225 Difference]: With dead ends: 35 [2018-11-07 16:40:05,704 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:40:05,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:40:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:40:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-07 16:40:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 16:40:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-07 16:40:05,710 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2018-11-07 16:40:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:05,710 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-07 16:40:05,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:40:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-07 16:40:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:40:05,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:05,711 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:05,712 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:05,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 26004059, now seen corresponding path program 3 times [2018-11-07 16:40:05,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:05,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:05,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:05,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:05,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:05,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:05,888 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:05,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:05,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:05,888 INFO L194 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 [2018-11-07 16:40:05,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:05,898 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:05,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:05,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:05,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:05,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:06,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:06,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:40:06,049 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:06,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:40:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:40:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:40:06,050 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 6 states. [2018-11-07 16:40:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:06,144 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-07 16:40:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:40:06,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 16:40:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:06,146 INFO L225 Difference]: With dead ends: 38 [2018-11-07 16:40:06,146 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 16:40:06,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:40:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 16:40:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-07 16:40:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 16:40:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-07 16:40:06,152 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-11-07 16:40:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:06,152 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-07 16:40:06,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:40:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-07 16:40:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:40:06,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:06,154 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:06,154 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:06,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash 821178397, now seen corresponding path program 3 times [2018-11-07 16:40:06,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:06,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:06,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:06,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:06,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:06,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:06,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:06,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:06,258 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:06,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:06,269 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:06,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:06,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:06,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:06,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:06,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:06,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:40:06,424 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:06,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:40:06,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:40:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:40:06,426 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 6 states. [2018-11-07 16:40:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:06,497 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-07 16:40:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:40:06,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 16:40:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:06,499 INFO L225 Difference]: With dead ends: 41 [2018-11-07 16:40:06,499 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 16:40:06,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:40:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 16:40:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-07 16:40:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 16:40:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-07 16:40:06,506 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 20 [2018-11-07 16:40:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:06,506 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-07 16:40:06,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:40:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-07 16:40:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:40:06,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:06,508 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:06,508 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:06,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash 427509150, now seen corresponding path program 4 times [2018-11-07 16:40:06,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:06,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:06,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:06,510 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:07,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:07,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:07,206 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:07,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:07,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:07,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:07,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:07,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:07,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:07,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:07,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:07,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:40:07,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:07,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:40:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:40:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:40:07,518 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-11-07 16:40:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:07,630 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-07 16:40:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:40:07,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-07 16:40:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:07,632 INFO L225 Difference]: With dead ends: 44 [2018-11-07 16:40:07,632 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 16:40:07,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:40:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 16:40:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-07 16:40:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 16:40:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-07 16:40:07,638 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2018-11-07 16:40:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:07,639 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-07 16:40:07,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:40:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-07 16:40:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:40:07,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:07,640 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:07,640 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:07,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 201615134, now seen corresponding path program 4 times [2018-11-07 16:40:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:07,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:07,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:07,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:07,828 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:07,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:07,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:07,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:07,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:07,841 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:07,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:07,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:08,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:08,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:40:08,104 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:08,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:40:08,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:40:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:40:08,119 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 7 states. [2018-11-07 16:40:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:08,256 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-07 16:40:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:40:08,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-07 16:40:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:08,260 INFO L225 Difference]: With dead ends: 47 [2018-11-07 16:40:08,260 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 16:40:08,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:40:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 16:40:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-07 16:40:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 16:40:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-07 16:40:08,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 23 [2018-11-07 16:40:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:08,264 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-07 16:40:08,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:40:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-07 16:40:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:40:08,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:08,266 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:08,266 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:08,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 181755771, now seen corresponding path program 5 times [2018-11-07 16:40:08,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:08,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:08,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:08,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:08,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:08,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:08,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:08,483 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:08,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:08,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:08,484 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:08,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:08,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:08,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:40:08,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:08,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:08,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:08,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:08,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 16:40:08,972 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:08,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:40:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:40:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:40:08,973 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2018-11-07 16:40:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:09,072 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-07 16:40:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:40:09,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-07 16:40:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:09,073 INFO L225 Difference]: With dead ends: 50 [2018-11-07 16:40:09,073 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 16:40:09,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:40:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 16:40:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-07 16:40:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:40:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-07 16:40:09,080 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2018-11-07 16:40:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:09,080 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-07 16:40:09,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:40:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-07 16:40:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:40:09,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:09,082 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:09,082 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:09,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:09,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1733081987, now seen corresponding path program 5 times [2018-11-07 16:40:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:09,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:09,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:09,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:09,084 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:09,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:09,265 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:09,265 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:09,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:09,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:09,265 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:09,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:09,273 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:21,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:40:21,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:21,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:40:21,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 16:40:24,107 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:40:24,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 18 [2018-11-07 16:40:24,107 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:40:24,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:40:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:40:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=246, Unknown=1, NotChecked=0, Total=306 [2018-11-07 16:40:24,108 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 7 states. [2018-11-07 16:40:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:24,253 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-07 16:40:24,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:40:24,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-07 16:40:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:24,254 INFO L225 Difference]: With dead ends: 49 [2018-11-07 16:40:24,255 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:40:24,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=71, Invalid=308, Unknown=1, NotChecked=0, Total=380 [2018-11-07 16:40:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:40:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 16:40:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 16:40:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 16:40:24,263 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-07 16:40:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:24,263 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 16:40:24,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:40:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 16:40:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:40:24,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:24,264 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:24,264 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:24,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1862081662, now seen corresponding path program 6 times [2018-11-07 16:40:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:24,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:24,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:24,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:24,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:24,402 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:24,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:24,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:24,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:24,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:24,411 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:24,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:24,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:24,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:24,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:25,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:25,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:40:25,075 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:25,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:40:25,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:40:25,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:40:25,076 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-11-07 16:40:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:25,168 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 16:40:25,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:40:25,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 16:40:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:25,169 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:40:25,169 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 16:40:25,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:40:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 16:40:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 16:40:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 16:40:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-07 16:40:25,174 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-07 16:40:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:25,174 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-07 16:40:25,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:40:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-07 16:40:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:40:25,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:25,175 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:25,175 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:25,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1688101733, now seen corresponding path program 7 times [2018-11-07 16:40:25,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:25,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:25,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:25,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:25,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:25,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:25,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:25,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:25,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:25,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:25,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:25,429 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:25,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:25,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:26,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:26,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 16:40:26,048 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:26,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:40:26,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:40:26,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:40:26,049 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-11-07 16:40:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:26,271 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-07 16:40:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:40:26,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 16:40:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:26,273 INFO L225 Difference]: With dead ends: 42 [2018-11-07 16:40:26,273 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:40:26,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:40:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:40:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 16:40:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:40:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 16:40:26,279 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-11-07 16:40:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:26,279 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 16:40:26,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:40:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 16:40:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 16:40:26,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:26,280 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:26,280 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:26,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:26,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1631958178, now seen corresponding path program 8 times [2018-11-07 16:40:26,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:26,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:26,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:26,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:26,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:26,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:26,467 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:26,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:26,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:26,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:26,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:26,479 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:26,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:40:26,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:26,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:26,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:27,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:27,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 16:40:27,400 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:27,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:40:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:40:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:40:27,401 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-11-07 16:40:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:27,578 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 16:40:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:40:27,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-07 16:40:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:27,582 INFO L225 Difference]: With dead ends: 45 [2018-11-07 16:40:27,582 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:40:27,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:40:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:40:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-07 16:40:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 16:40:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-07 16:40:27,587 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-07 16:40:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:27,587 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-07 16:40:27,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:40:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-07 16:40:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 16:40:27,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:27,588 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:27,589 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:27,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:27,589 INFO L82 PathProgramCache]: Analyzing trace with hash 198410683, now seen corresponding path program 9 times [2018-11-07 16:40:27,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:27,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:27,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:27,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:27,808 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:27,809 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:27,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:27,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:27,809 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:27,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:27,817 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:27,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:27,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:27,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:27,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:28,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:28,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:40:28,591 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:28,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:40:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:40:28,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:40:28,592 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-11-07 16:40:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:28,867 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-07 16:40:28,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:40:28,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-07 16:40:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:28,867 INFO L225 Difference]: With dead ends: 48 [2018-11-07 16:40:28,868 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 16:40:28,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:40:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 16:40:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-07 16:40:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:40:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 16:40:28,874 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-11-07 16:40:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:28,874 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 16:40:28,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:40:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 16:40:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:40:28,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:28,875 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:28,876 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:28,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash -187641282, now seen corresponding path program 10 times [2018-11-07 16:40:28,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:28,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:28,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:29,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:29,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:29,290 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:29,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:29,290 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:29,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:29,307 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:29,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:29,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:30,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:30,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:40:30,360 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:30,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:40:30,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:40:30,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:40:30,362 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2018-11-07 16:40:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:30,594 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 16:40:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:40:30,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 16:40:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:30,596 INFO L225 Difference]: With dead ends: 51 [2018-11-07 16:40:30,596 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 16:40:30,597 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:40:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 16:40:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-07 16:40:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 16:40:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-07 16:40:30,601 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-11-07 16:40:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:30,601 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-07 16:40:30,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:40:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-07 16:40:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:40:30,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:30,602 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:30,602 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:30,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash 860688091, now seen corresponding path program 11 times [2018-11-07 16:40:30,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:30,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:30,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:30,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:30,857 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:30,857 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:30,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:30,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:30,857 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:30,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:30,866 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:31,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:40:31,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:31,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:31,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:32,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:32,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 16:40:32,769 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:32,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:40:32,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:40:32,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:40:32,770 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-11-07 16:40:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:33,053 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-07 16:40:33,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:40:33,055 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 16:40:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:33,056 INFO L225 Difference]: With dead ends: 54 [2018-11-07 16:40:33,057 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 16:40:33,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:40:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 16:40:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 16:40:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:40:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 16:40:33,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-11-07 16:40:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:33,063 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 16:40:33,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:40:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 16:40:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 16:40:33,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:33,064 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:33,064 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:33,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1361137378, now seen corresponding path program 12 times [2018-11-07 16:40:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:33,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:33,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:34,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:34,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:34,161 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:34,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:34,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:34,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:34,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:34,172 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:34,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:34,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:34,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:34,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 16:40:35,709 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:35,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:40:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:40:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:40:35,711 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 15 states. [2018-11-07 16:40:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:36,071 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 16:40:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:40:36,071 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-07 16:40:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:36,072 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:40:36,072 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 16:40:36,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:40:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 16:40:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-07 16:40:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 16:40:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-07 16:40:36,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-11-07 16:40:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:36,079 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-07 16:40:36,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:40:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-07 16:40:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 16:40:36,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:36,080 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:36,081 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:36,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:36,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2022685701, now seen corresponding path program 13 times [2018-11-07 16:40:36,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:36,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:36,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:36,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:36,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:36,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:36,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:36,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:36,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:36,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:36,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:36,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:36,459 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:40:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:36,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:36,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:38,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:38,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:40:38,033 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:38,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:40:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:40:38,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:40:38,034 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2018-11-07 16:40:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:38,353 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-07 16:40:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:40:38,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-07 16:40:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:38,357 INFO L225 Difference]: With dead ends: 60 [2018-11-07 16:40:38,357 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 16:40:38,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:40:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 16:40:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-07 16:40:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:40:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 16:40:38,362 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-11-07 16:40:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:38,362 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 16:40:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:40:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 16:40:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 16:40:38,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:38,363 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:38,363 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -603854850, now seen corresponding path program 14 times [2018-11-07 16:40:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:40:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:38,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:38,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:38,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:38,621 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:38,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:38,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:38,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:38,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:40:38,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:41:04,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 16:41:04,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:41:04,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:41:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:04,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:18,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:18,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 33 [2018-11-07 16:41:18,912 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:18,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:41:18,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:41:18,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=748, Unknown=4, NotChecked=0, Total=1056 [2018-11-07 16:41:18,913 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 17 states. [2018-11-07 16:41:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:19,418 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 16:41:19,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:41:19,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 16:41:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:19,420 INFO L225 Difference]: With dead ends: 63 [2018-11-07 16:41:19,421 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 16:41:19,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=304, Invalid=748, Unknown=4, NotChecked=0, Total=1056 [2018-11-07 16:41:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 16:41:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-07 16:41:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-07 16:41:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-07 16:41:19,426 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-11-07 16:41:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:19,426 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-07 16:41:19,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:41:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-07 16:41:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-07 16:41:19,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:19,427 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:19,428 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:19,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1012867355, now seen corresponding path program 15 times [2018-11-07 16:41:19,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:19,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:19,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:41:19,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:19,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:19,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:19,946 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:41:19,946 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:41:19,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:41:19,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:19,946 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:41:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:41:19,955 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:41:19,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:41:19,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:41:19,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:41:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:19,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:21,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:21,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 16:41:21,919 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:21,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:41:21,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:41:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:41:21,920 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-11-07 16:41:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:22,359 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 16:41:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:41:22,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-07 16:41:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:22,361 INFO L225 Difference]: With dead ends: 66 [2018-11-07 16:41:22,361 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 16:41:22,361 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:41:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 16:41:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 16:41:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 16:41:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 16:41:22,364 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-11-07 16:41:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:22,365 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 16:41:22,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:41:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 16:41:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 16:41:22,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:22,366 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:22,366 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:22,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1020819166, now seen corresponding path program 16 times [2018-11-07 16:41:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:22,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:41:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:22,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:22,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:22,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:41:22,853 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:41:22,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:41:22,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:22,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:41:22,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:41:22,867 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:41:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:22,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:41:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:22,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:24,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:24,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 16:41:24,971 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:24,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:41:24,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:41:24,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:41:24,972 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-11-07 16:41:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:25,501 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-07 16:41:25,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:41:25,502 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 16:41:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:25,503 INFO L225 Difference]: With dead ends: 69 [2018-11-07 16:41:25,503 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 16:41:25,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:41:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 16:41:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 16:41:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 16:41:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-07 16:41:25,507 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-11-07 16:41:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:25,507 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-07 16:41:25,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:41:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-07 16:41:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 16:41:25,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:25,508 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:25,509 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:25,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1690019387, now seen corresponding path program 17 times [2018-11-07 16:41:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:25,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:41:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:25,510 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:25,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:25,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:41:25,878 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:41:25,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:41:25,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:25,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:41:25,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:41:25,888 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:41:27,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 16:41:27,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:41:27,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:41:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:27,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:30,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:30,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 16:41:30,069 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:30,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:41:30,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:41:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:41:30,070 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 20 states. [2018-11-07 16:41:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:30,784 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-07 16:41:30,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:41:30,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-07 16:41:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:30,786 INFO L225 Difference]: With dead ends: 72 [2018-11-07 16:41:30,786 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 16:41:30,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:41:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 16:41:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-07 16:41:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 16:41:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-07 16:41:30,792 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-11-07 16:41:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:30,792 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-07 16:41:30,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:41:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-07 16:41:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:41:30,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:30,793 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:30,793 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:30,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash 595615166, now seen corresponding path program 18 times [2018-11-07 16:41:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:30,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:41:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:30,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:31,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:31,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:41:31,617 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:41:31,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:41:31,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:31,617 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:41:31,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:41:31,626 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:41:31,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:41:31,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:41:31,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:41:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:31,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:34,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 16:41:34,980 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:34,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:41:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:41:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:41:34,982 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 21 states. [2018-11-07 16:41:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:35,640 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 16:41:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:41:35,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-07 16:41:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:35,642 INFO L225 Difference]: With dead ends: 75 [2018-11-07 16:41:35,642 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:41:35,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:41:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:41:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-07 16:41:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 16:41:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-07 16:41:35,647 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-11-07 16:41:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:35,647 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-07 16:41:35,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:41:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-07 16:41:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-07 16:41:35,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:35,648 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:35,648 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:35,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash 296211291, now seen corresponding path program 19 times [2018-11-07 16:41:35,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:35,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:35,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:41:35,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:35,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:36,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:36,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:41:36,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:41:36,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:41:36,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:36,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:41:36,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:41:36,386 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:41:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:36,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:41:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:36,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:39,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:39,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 16:41:39,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:39,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:41:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:41:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:41:39,779 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 22 states. [2018-11-07 16:41:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:40,396 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 16:41:40,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:41:40,397 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-07 16:41:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:40,397 INFO L225 Difference]: With dead ends: 78 [2018-11-07 16:41:40,397 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 16:41:40,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:41:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 16:41:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 16:41:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 16:41:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 16:41:40,402 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-11-07 16:41:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:40,402 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 16:41:40,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:41:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 16:41:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 16:41:40,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:40,403 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:40,403 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:40,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1402444958, now seen corresponding path program 20 times [2018-11-07 16:41:40,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:40,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:41:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:40,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:41:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:40,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:40,835 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:41:40,835 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:41:40,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:41:40,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:41:40,835 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:41:40,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:41:40,845 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:41:56,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 16:41:56,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:41:56,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:41:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:56,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:59,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:59,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 16:41:59,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:59,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:41:59,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:41:59,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:41:59,234 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 23 states. [2018-11-07 16:41:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:59,862 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-07 16:41:59,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:41:59,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-07 16:41:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:59,864 INFO L225 Difference]: With dead ends: 81 [2018-11-07 16:41:59,864 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 16:41:59,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:41:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 16:41:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-07 16:41:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 16:41:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-07 16:41:59,870 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-11-07 16:41:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:59,870 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-07 16:41:59,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:41:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-07 16:41:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 16:41:59,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:59,871 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:59,871 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:59,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1925556347, now seen corresponding path program 21 times [2018-11-07 16:41:59,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:59,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:41:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:59,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:01,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:01,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:42:01,211 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:42:01,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:42:01,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:01,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:42:01,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:42:01,222 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:42:01,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:42:01,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:42:01,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:42:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:01,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:42:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:04,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:42:04,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 16:42:04,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:42:04,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:42:04,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:42:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:42:04,465 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-11-07 16:42:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:05,138 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-07 16:42:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:42:05,138 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 16:42:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:05,139 INFO L225 Difference]: With dead ends: 84 [2018-11-07 16:42:05,140 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 16:42:05,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:42:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 16:42:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-07 16:42:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 16:42:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-07 16:42:05,146 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-11-07 16:42:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:05,146 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-07 16:42:05,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:42:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-07 16:42:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 16:42:05,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:05,147 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:42:05,147 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:05,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:05,148 INFO L82 PathProgramCache]: Analyzing trace with hash -499371138, now seen corresponding path program 22 times [2018-11-07 16:42:05,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:05,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:42:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:05,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:06,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:06,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:42:06,450 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:42:06,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:42:06,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:06,451 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:42:06,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:06,459 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:42:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:06,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:42:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:06,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:42:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:10,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:42:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 16:42:10,511 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:42:10,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:42:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:42:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:42:10,512 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-11-07 16:42:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:11,384 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 16:42:11,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:42:11,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 16:42:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:11,385 INFO L225 Difference]: With dead ends: 87 [2018-11-07 16:42:11,386 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 16:42:11,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:42:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 16:42:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-07 16:42:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 16:42:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-07 16:42:11,391 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-11-07 16:42:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:11,392 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-07 16:42:11,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:42:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-07 16:42:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 16:42:11,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:11,393 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:42:11,393 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:11,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash -164158053, now seen corresponding path program 23 times [2018-11-07 16:42:11,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:11,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:42:11,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:11,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:42:11,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:42:11,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:42:11,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:42:11,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:42:11,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:42:11,954 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:43:56,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 16:43:56,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:43:56,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:56,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:01,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:01,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-11-07 16:44:01,182 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:01,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 16:44:01,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 16:44:01,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:44:01,184 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 26 states. [2018-11-07 16:44:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:02,043 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-07 16:44:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 16:44:02,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-11-07 16:44:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:02,044 INFO L225 Difference]: With dead ends: 90 [2018-11-07 16:44:02,044 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 16:44:02,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 16:44:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 16:44:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-07 16:44:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 16:44:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-07 16:44:02,050 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-11-07 16:44:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:02,050 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-07 16:44:02,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 16:44:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-07 16:44:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 16:44:02,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:02,051 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:02,051 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:02,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 369893982, now seen corresponding path program 24 times [2018-11-07 16:44:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:02,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:02,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:02,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:02,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:02,608 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:02,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:02,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:02,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:02,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:44:02,617 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:44:02,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:44:02,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:44:02,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:02,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:07,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:07,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 16:44:07,120 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:07,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:44:07,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:44:07,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:44:07,121 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 27 states. [2018-11-07 16:44:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:07,974 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-07 16:44:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:44:07,975 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-07 16:44:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:07,976 INFO L225 Difference]: With dead ends: 93 [2018-11-07 16:44:07,976 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 16:44:07,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:44:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 16:44:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-07 16:44:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 16:44:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-07 16:44:07,982 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-11-07 16:44:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:07,982 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-07 16:44:07,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:44:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-07 16:44:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 16:44:07,983 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:07,983 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:07,983 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:07,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1755204283, now seen corresponding path program 25 times [2018-11-07 16:44:07,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:07,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:44:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:07,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:08,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:08,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:08,467 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:08,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:08,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:08,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:08,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:08,475 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:08,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:08,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:13,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:13,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-07 16:44:13,515 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:13,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:44:13,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:44:13,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=2082, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:44:13,517 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 28 states. [2018-11-07 16:44:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:14,578 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-07 16:44:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:44:14,578 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-07 16:44:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:14,579 INFO L225 Difference]: With dead ends: 96 [2018-11-07 16:44:14,580 INFO L226 Difference]: Without dead ends: 91 [2018-11-07 16:44:14,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=780, Invalid=2082, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:44:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-07 16:44:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-07 16:44:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 16:44:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-11-07 16:44:14,585 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-11-07 16:44:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:14,585 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-11-07 16:44:14,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:44:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-07 16:44:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 16:44:14,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:14,586 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:14,586 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:14,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1193634110, now seen corresponding path program 26 times [2018-11-07 16:44:14,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:14,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:14,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:44:15,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:15,117 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:15,117 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:44:15,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:44:15,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:15,117 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:15,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:44:15,126 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown