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-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:12:01,186 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:12:01,188 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:12:01,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:12:01,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:12:01,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:12:01,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:12:01,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:12:01,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:12:01,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:12:01,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:12:01,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:12:01,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:12:01,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:12:01,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:12:01,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:12:01,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:12:01,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:12:01,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:12:01,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:12:01,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:12:01,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:12:01,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:12:01,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:12:01,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:12:01,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:12:01,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:12:01,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:12:01,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:12:01,228 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:12:01,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:12:01,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:12:01,229 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:12:01,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:12:01,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:12:01,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:12:01,232 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-LIM.epf [2018-11-07 22:12:01,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:12:01,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:12:01,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:12:01,248 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:12:01,248 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:12:01,249 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:12:01,249 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:12:01,249 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:12:01,249 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:12:01,249 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:12:01,249 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:12:01,250 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:12:01,250 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:12:01,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:12:01,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:12:01,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:12:01,251 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:12:01,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:12:01,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:12:01,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:12:01,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:12:01,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:12:01,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:12:01,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:12:01,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:12:01,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:12:01,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:12:01,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:12:01,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:12:01,254 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:12:01,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:12:01,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:12:01,254 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:12:01,255 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:12:01,255 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:12:01,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:12:01,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:12:01,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:12:01,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:12:01,315 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:12:01,316 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 22:12:01,374 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55095b088/e3e233aaf3b049eab33c9540e59da57d/FLAG0ab5b2549 [2018-11-07 22:12:01,790 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:12:01,791 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 22:12:01,797 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55095b088/e3e233aaf3b049eab33c9540e59da57d/FLAG0ab5b2549 [2018-11-07 22:12:01,817 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55095b088/e3e233aaf3b049eab33c9540e59da57d [2018-11-07 22:12:01,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:12:01,832 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:12:01,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:12:01,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:12:01,838 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:12:01,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:12:01" (1/1) ... [2018-11-07 22:12:01,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447dbca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:01, skipping insertion in model container [2018-11-07 22:12:01,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:12:01" (1/1) ... [2018-11-07 22:12:01,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:12:01,879 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:12:02,122 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:12:02,126 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:12:02,142 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:12:02,159 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:12:02,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02 WrapperNode [2018-11-07 22:12:02,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:12:02,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:12:02,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:12:02,161 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:12:02,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:12:02,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:12:02,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:12:02,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:12:02,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (1/1) ... [2018-11-07 22:12:02,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:12:02,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:12:02,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:12:02,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:12:02,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (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 22:12:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:12:02,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:12:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:12:02,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:12:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:12:02,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:12:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:12:02,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:12:02,694 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:12:02,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:02 BoogieIcfgContainer [2018-11-07 22:12:02,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:12:02,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:12:02,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:12:02,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:12:02,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:12:01" (1/3) ... [2018-11-07 22:12:02,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3d624d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:02, skipping insertion in model container [2018-11-07 22:12:02,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:02" (2/3) ... [2018-11-07 22:12:02,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3d624d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:02, skipping insertion in model container [2018-11-07 22:12:02,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:02" (3/3) ... [2018-11-07 22:12:02,702 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 22:12:02,712 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:12:02,719 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:12:02,736 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:12:02,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:12:02,770 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:12:02,770 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:12:02,770 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:12:02,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:12:02,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:12:02,771 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:12:02,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:12:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-07 22:12:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:12:02,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:02,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:02,799 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:02,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash -745796184, now seen corresponding path program 1 times [2018-11-07 22:12:02,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:02,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:02,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:02,905 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 22:12:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:02,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:12:02,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:02,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:12:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:12:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:12:02,929 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-07 22:12:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:02,953 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-07 22:12:02,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:12:02,955 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 22:12:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:02,963 INFO L225 Difference]: With dead ends: 45 [2018-11-07 22:12:02,963 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 22:12:02,967 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 22:12:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 22:12:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 22:12:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 22:12:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 22:12:03,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 22:12:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:03,005 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 22:12:03,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:12:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 22:12:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:12:03,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:03,006 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:03,006 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:03,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 800081396, now seen corresponding path program 1 times [2018-11-07 22:12:03,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,154 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 22:12:03,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:03,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:12:03,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:03,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:12:03,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:12:03,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:03,158 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-07 22:12:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:03,282 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-07 22:12:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:12:03,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-07 22:12:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:03,284 INFO L225 Difference]: With dead ends: 32 [2018-11-07 22:12:03,284 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 22:12:03,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 22:12:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 22:12:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 22:12:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-07 22:12:03,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2018-11-07 22:12:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:03,292 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-07 22:12:03,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:12:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-07 22:12:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:12:03,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:03,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:03,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:03,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1097925811, now seen corresponding path program 1 times [2018-11-07 22:12:03,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,297 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 22:12:03,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:03,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:12:03,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:03,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:12:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:12:03,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:03,405 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-07 22:12:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:03,552 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-07 22:12:03,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:12:03,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-07 22:12:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:03,555 INFO L225 Difference]: With dead ends: 35 [2018-11-07 22:12:03,555 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 22:12:03,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 22:12:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-07 22:12:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 22:12:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-07 22:12:03,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-11-07 22:12:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:03,561 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-07 22:12:03,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:12:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-07 22:12:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:12:03,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:03,562 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:03,562 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:03,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,563 INFO L82 PathProgramCache]: Analyzing trace with hash -278190259, now seen corresponding path program 1 times [2018-11-07 22:12:03,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:03,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:03,761 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:03,762 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 22:12:03,764 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-07 22:12:03,798 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:12:03,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:12:04,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:12:04,095 INFO L272 AbstractInterpreter]: Visited 19 different actions 92 times. Merged at 5 different actions 43 times. Widened at 1 different actions 5 times. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-07 22:12:04,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:04,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:12:04,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:04,143 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 22:12:04,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:04,164 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:04,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:04,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:04,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:04,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-07 22:12:04,527 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:04,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:12:04,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:12:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:12:04,531 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-11-07 22:12:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:04,755 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-07 22:12:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:12:04,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 22:12:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:04,760 INFO L225 Difference]: With dead ends: 63 [2018-11-07 22:12:04,761 INFO L226 Difference]: Without dead ends: 53 [2018-11-07 22:12:04,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:12:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-07 22:12:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-07 22:12:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 22:12:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-07 22:12:04,768 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 21 [2018-11-07 22:12:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:04,769 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-07 22:12:04,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:12:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-07 22:12:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 22:12:04,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:04,771 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:04,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:04,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:04,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2006845708, now seen corresponding path program 1 times [2018-11-07 22:12:04,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:04,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:04,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:04,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:04,773 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:04,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:04,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:04,938 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-07 22:12:04,938 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [17], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-07 22:12:04,940 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:12:04,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:12:05,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:12:05,139 INFO L272 AbstractInterpreter]: Visited 20 different actions 156 times. Merged at 10 different actions 89 times. Widened at 3 different actions 11 times. Found 13 fixpoints after 4 different actions. Largest state had 7 variables. [2018-11-07 22:12:05,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:05,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:12:05,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:05,176 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 22:12:05,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:05,188 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:05,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:05,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:05,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:05,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 22:12:05,804 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:05,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:12:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:12:05,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:12:05,806 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-11-07 22:12:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:05,923 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-07 22:12:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:12:05,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-07 22:12:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:05,928 INFO L225 Difference]: With dead ends: 75 [2018-11-07 22:12:05,928 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:12:05,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:12:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:12:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2018-11-07 22:12:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 22:12:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 22:12:05,936 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 30 [2018-11-07 22:12:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:05,937 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 22:12:05,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:12:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 22:12:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 22:12:05,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:05,938 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:05,939 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:05,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash 750227251, now seen corresponding path program 2 times [2018-11-07 22:12:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:06,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:06,127 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:06,127 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:06,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:06,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:06,128 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 22:12:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:06,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:06,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:12:06,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:06,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 22:12:06,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 22:12:06,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:06,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2018-11-07 22:12:06,483 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:06,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:12:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:12:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:12:06,485 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-11-07 22:12:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:06,938 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-11-07 22:12:06,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:12:06,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-07 22:12:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:06,940 INFO L225 Difference]: With dead ends: 112 [2018-11-07 22:12:06,941 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 22:12:06,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:12:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 22:12:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-11-07 22:12:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 22:12:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-07 22:12:06,951 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 33 [2018-11-07 22:12:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:06,951 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-07 22:12:06,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:12:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-07 22:12:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 22:12:06,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:06,953 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:06,954 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:06,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:06,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1707835635, now seen corresponding path program 3 times [2018-11-07 22:12:06,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:06,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:06,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:07,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:07,251 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:07,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:07,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,251 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 22:12:07,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:07,260 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:07,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:07,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:07,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:07,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:07,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:07,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 22:12:07,664 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:07,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:12:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:12:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:12:07,666 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 14 states. [2018-11-07 22:12:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:07,842 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-11-07 22:12:07,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:12:07,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-07 22:12:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:07,845 INFO L225 Difference]: With dead ends: 122 [2018-11-07 22:12:07,845 INFO L226 Difference]: Without dead ends: 116 [2018-11-07 22:12:07,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:12:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-07 22:12:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 77. [2018-11-07 22:12:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 22:12:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-07 22:12:07,855 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 45 [2018-11-07 22:12:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:07,856 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-07 22:12:07,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:12:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-07 22:12:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-07 22:12:07,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:07,858 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:07,858 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:07,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1071743214, now seen corresponding path program 4 times [2018-11-07 22:12:07,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:07,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:07,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:08,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:08,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:08,040 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:08,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:08,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:08,041 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 22:12:08,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:08,053 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:08,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:08,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:08,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:08,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 22:12:08,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:08,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:12:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:12:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:12:08,609 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 15 states. [2018-11-07 22:12:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:08,778 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-11-07 22:12:08,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:12:08,779 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-07 22:12:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:08,781 INFO L225 Difference]: With dead ends: 129 [2018-11-07 22:12:08,781 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 22:12:08,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:12:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 22:12:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2018-11-07 22:12:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 22:12:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-07 22:12:08,790 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 48 [2018-11-07 22:12:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:08,790 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-07 22:12:08,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:12:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-07 22:12:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 22:12:08,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:08,792 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:08,793 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:08,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash 535766893, now seen corresponding path program 5 times [2018-11-07 22:12:08,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:08,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:08,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:09,031 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 22:12:09,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:09,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:09,032 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:09,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:09,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:09,032 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 22:12:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:09,041 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:09,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:12:09,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:09,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 22:12:09,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 22:12:09,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 26 [2018-11-07 22:12:09,342 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:09,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:12:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:12:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2018-11-07 22:12:09,343 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 20 states. [2018-11-07 22:12:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:09,663 INFO L93 Difference]: Finished difference Result 181 states and 202 transitions. [2018-11-07 22:12:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:12:09,664 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-11-07 22:12:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:09,666 INFO L225 Difference]: With dead ends: 181 [2018-11-07 22:12:09,666 INFO L226 Difference]: Without dead ends: 167 [2018-11-07 22:12:09,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:12:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-07 22:12:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 115. [2018-11-07 22:12:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:12:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-11-07 22:12:09,677 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 51 [2018-11-07 22:12:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:09,677 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-11-07 22:12:09,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:12:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-11-07 22:12:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 22:12:09,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:09,680 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:09,680 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:09,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash 227276404, now seen corresponding path program 6 times [2018-11-07 22:12:09,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:09,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:09,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:10,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:10,060 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:10,060 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:10,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:10,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:10,061 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 22:12:10,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:10,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:10,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:10,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:10,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:10,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:10,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:10,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 22:12:10,878 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:10,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:12:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:12:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 22:12:10,880 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 21 states. [2018-11-07 22:12:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:11,055 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-11-07 22:12:11,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:12:11,056 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-11-07 22:12:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:11,058 INFO L225 Difference]: With dead ends: 186 [2018-11-07 22:12:11,058 INFO L226 Difference]: Without dead ends: 180 [2018-11-07 22:12:11,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:12:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-07 22:12:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 122. [2018-11-07 22:12:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 22:12:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-11-07 22:12:11,066 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 66 [2018-11-07 22:12:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:11,067 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-11-07 22:12:11,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:12:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-11-07 22:12:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 22:12:11,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:11,069 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:11,069 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:11,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1732418355, now seen corresponding path program 7 times [2018-11-07 22:12:11,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:11,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:11,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:11,071 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:11,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:11,439 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:11,439 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:11,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:11,440 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 22:12:11,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:11,448 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:11,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:11,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:12,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 22:12:12,084 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:12,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:12:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:12:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 22:12:12,086 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 22 states. [2018-11-07 22:12:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:12,281 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2018-11-07 22:12:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:12:12,282 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-11-07 22:12:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:12,284 INFO L225 Difference]: With dead ends: 193 [2018-11-07 22:12:12,284 INFO L226 Difference]: Without dead ends: 187 [2018-11-07 22:12:12,286 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:12:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-07 22:12:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 129. [2018-11-07 22:12:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 22:12:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2018-11-07 22:12:12,293 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 69 [2018-11-07 22:12:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:12,293 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2018-11-07 22:12:12,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:12:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2018-11-07 22:12:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-07 22:12:12,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:12,295 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:12,295 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:12,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1957710356, now seen corresponding path program 8 times [2018-11-07 22:12:12,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:12,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:12,297 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:12,667 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 22:12:12,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:12,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:12,667 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:12,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:12,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:12,668 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 22:12:12,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:12,676 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:12,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:12:12,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:12,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-07 22:12:13,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-07 22:12:13,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:13,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9, 9] total 35 [2018-11-07 22:12:13,661 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:13,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:12:13,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:12:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:12:13,663 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 28 states. [2018-11-07 22:12:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:14,043 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2018-11-07 22:12:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:12:14,044 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2018-11-07 22:12:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:14,046 INFO L225 Difference]: With dead ends: 263 [2018-11-07 22:12:14,046 INFO L226 Difference]: Without dead ends: 247 [2018-11-07 22:12:14,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 22:12:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-07 22:12:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2018-11-07 22:12:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:12:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-11-07 22:12:14,054 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 72 [2018-11-07 22:12:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:14,055 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-11-07 22:12:14,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:12:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-11-07 22:12:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 22:12:14,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:14,057 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:14,057 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:14,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1693515634, now seen corresponding path program 9 times [2018-11-07 22:12:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:14,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:14,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:14,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:15,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:15,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:15,027 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:15,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:15,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:15,027 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 22:12:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:15,037 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:15,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:15,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:15,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:15,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 615 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:17,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:17,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-07 22:12:17,412 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:17,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:12:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:12:17,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:12:17,414 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 29 states. [2018-11-07 22:12:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:17,700 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2018-11-07 22:12:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:12:17,700 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-11-07 22:12:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:17,703 INFO L225 Difference]: With dead ends: 260 [2018-11-07 22:12:17,703 INFO L226 Difference]: Without dead ends: 254 [2018-11-07 22:12:17,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:12:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-07 22:12:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 174. [2018-11-07 22:12:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 22:12:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2018-11-07 22:12:17,710 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 90 [2018-11-07 22:12:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:17,711 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2018-11-07 22:12:17,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:12:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2018-11-07 22:12:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 22:12:17,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:17,712 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:17,713 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:17,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1143150669, now seen corresponding path program 10 times [2018-11-07 22:12:17,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:17,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:17,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:18,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:18,788 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:18,788 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:18,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:18,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:18,789 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 22:12:18,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:18,798 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:18,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:18,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:19,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:19,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-07 22:12:19,954 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:19,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:12:19,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:12:19,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:12:19,956 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand 30 states. [2018-11-07 22:12:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:20,246 INFO L93 Difference]: Finished difference Result 267 states and 294 transitions. [2018-11-07 22:12:20,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 22:12:20,246 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-11-07 22:12:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:20,248 INFO L225 Difference]: With dead ends: 267 [2018-11-07 22:12:20,248 INFO L226 Difference]: Without dead ends: 261 [2018-11-07 22:12:20,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:12:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-07 22:12:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 181. [2018-11-07 22:12:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-07 22:12:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-11-07 22:12:20,255 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 93 [2018-11-07 22:12:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:20,255 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-11-07 22:12:20,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:12:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-11-07 22:12:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-07 22:12:20,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:20,257 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:20,257 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:20,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash 492467246, now seen corresponding path program 11 times [2018-11-07 22:12:20,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:20,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:20,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,259 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:20,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:20,839 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:20,840 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:20,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:20,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:20,840 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 22:12:20,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:20,850 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:20,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:12:20,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:20,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-07 22:12:21,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-07 22:12:21,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:21,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10, 10] total 45 [2018-11-07 22:12:21,470 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:21,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:12:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:12:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:12:21,472 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 37 states. [2018-11-07 22:12:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:21,973 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2018-11-07 22:12:21,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:12:21,983 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-11-07 22:12:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:21,985 INFO L225 Difference]: With dead ends: 358 [2018-11-07 22:12:21,985 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 22:12:21,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:12:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 22:12:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 226. [2018-11-07 22:12:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-07 22:12:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2018-11-07 22:12:21,993 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 254 transitions. Word has length 96 [2018-11-07 22:12:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:21,994 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 254 transitions. [2018-11-07 22:12:21,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:12:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 254 transitions. [2018-11-07 22:12:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 22:12:21,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:21,996 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:21,996 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:21,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash 494608371, now seen corresponding path program 12 times [2018-11-07 22:12:21,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:22,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:22,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:22,831 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:22,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:22,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:22,832 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 22:12:22,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:22,842 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:22,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:22,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:22,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:22,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 0 proven. 1197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:24,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:24,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-07 22:12:24,324 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:24,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:12:24,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:12:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 22:12:24,328 INFO L87 Difference]: Start difference. First operand 226 states and 254 transitions. Second operand 38 states. [2018-11-07 22:12:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:24,733 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-11-07 22:12:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:12:24,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2018-11-07 22:12:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:24,736 INFO L225 Difference]: With dead ends: 344 [2018-11-07 22:12:24,736 INFO L226 Difference]: Without dead ends: 338 [2018-11-07 22:12:24,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:12:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-07 22:12:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 233. [2018-11-07 22:12:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-07 22:12:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-11-07 22:12:24,743 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 117 [2018-11-07 22:12:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:24,744 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-11-07 22:12:24,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:12:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-11-07 22:12:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-07 22:12:24,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:24,745 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:24,746 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:24,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -612030252, now seen corresponding path program 13 times [2018-11-07 22:12:24,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:24,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:24,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:25,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:25,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:25,387 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:25,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:25,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:25,387 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 22:12:25,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:25,395 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:25,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:25,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:27,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:27,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-07 22:12:27,056 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:27,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:12:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:12:27,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 22:12:27,059 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 39 states. [2018-11-07 22:12:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:27,473 INFO L93 Difference]: Finished difference Result 351 states and 387 transitions. [2018-11-07 22:12:27,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:12:27,474 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-11-07 22:12:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:27,476 INFO L225 Difference]: With dead ends: 351 [2018-11-07 22:12:27,476 INFO L226 Difference]: Without dead ends: 345 [2018-11-07 22:12:27,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 22:12:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-07 22:12:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 240. [2018-11-07 22:12:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-07 22:12:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2018-11-07 22:12:27,485 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 120 [2018-11-07 22:12:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:27,485 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2018-11-07 22:12:27,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:12:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2018-11-07 22:12:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 22:12:27,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:27,487 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:27,487 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:27,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -314283949, now seen corresponding path program 14 times [2018-11-07 22:12:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:27,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:27,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 1368 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:28,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:28,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:28,347 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:28,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:28,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:28,348 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 22:12:28,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:28,358 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:28,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:12:28,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:28,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-07 22:12:28,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-07 22:12:28,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:28,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 11, 11] total 56 [2018-11-07 22:12:28,905 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:28,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:12:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:12:28,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 22:12:28,908 INFO L87 Difference]: Start difference. First operand 240 states and 270 transitions. Second operand 47 states. [2018-11-07 22:12:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:30,551 INFO L93 Difference]: Finished difference Result 466 states and 517 transitions. [2018-11-07 22:12:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:12:30,551 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 123 [2018-11-07 22:12:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:30,554 INFO L225 Difference]: With dead ends: 466 [2018-11-07 22:12:30,554 INFO L226 Difference]: Without dead ends: 446 [2018-11-07 22:12:30,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:12:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-07 22:12:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 292. [2018-11-07 22:12:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-07 22:12:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 329 transitions. [2018-11-07 22:12:30,563 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 329 transitions. Word has length 123 [2018-11-07 22:12:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:30,564 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 329 transitions. [2018-11-07 22:12:30,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:12:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 329 transitions. [2018-11-07 22:12:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 22:12:30,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:30,566 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:30,566 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:30,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash -755226131, now seen corresponding path program 15 times [2018-11-07 22:12:30,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:30,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:30,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:31,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:31,439 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:31,439 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:31,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:31,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:31,439 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 22:12:31,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:31,448 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:31,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:31,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:31,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:31,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 0 proven. 2082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:34,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:34,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-07 22:12:34,080 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:34,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:12:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:12:34,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 22:12:34,083 INFO L87 Difference]: Start difference. First operand 292 states and 329 transitions. Second operand 48 states. [2018-11-07 22:12:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:34,626 INFO L93 Difference]: Finished difference Result 438 states and 483 transitions. [2018-11-07 22:12:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 22:12:34,629 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2018-11-07 22:12:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:34,631 INFO L225 Difference]: With dead ends: 438 [2018-11-07 22:12:34,632 INFO L226 Difference]: Without dead ends: 432 [2018-11-07 22:12:34,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:12:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-07 22:12:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 299. [2018-11-07 22:12:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-07 22:12:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 337 transitions. [2018-11-07 22:12:34,639 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 337 transitions. Word has length 147 [2018-11-07 22:12:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:34,640 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 337 transitions. [2018-11-07 22:12:34,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:12:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 337 transitions. [2018-11-07 22:12:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-07 22:12:34,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:34,642 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:34,642 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:34,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1973406962, now seen corresponding path program 16 times [2018-11-07 22:12:34,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:34,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:34,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:34,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:34,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:35,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:35,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:35,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:35,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:35,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:35,528 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 22:12:35,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:35,538 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:35,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:35,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2193 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:38,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:38,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-07 22:12:38,093 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:38,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:12:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:12:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 22:12:38,095 INFO L87 Difference]: Start difference. First operand 299 states and 337 transitions. Second operand 49 states. [2018-11-07 22:12:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:38,888 INFO L93 Difference]: Finished difference Result 445 states and 491 transitions. [2018-11-07 22:12:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:12:38,889 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-11-07 22:12:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:38,892 INFO L225 Difference]: With dead ends: 445 [2018-11-07 22:12:38,892 INFO L226 Difference]: Without dead ends: 439 [2018-11-07 22:12:38,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:12:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-11-07 22:12:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 306. [2018-11-07 22:12:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-07 22:12:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 345 transitions. [2018-11-07 22:12:38,900 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 345 transitions. Word has length 150 [2018-11-07 22:12:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:38,900 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 345 transitions. [2018-11-07 22:12:38,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:12:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 345 transitions. [2018-11-07 22:12:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 22:12:38,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:38,902 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:38,903 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:38,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash -324892083, now seen corresponding path program 17 times [2018-11-07 22:12:38,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:38,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 2307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:39,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:39,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:39,894 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:39,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:39,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:39,894 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 22:12:39,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:39,903 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:39,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 22:12:39,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:39,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-07 22:12:40,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 2223 trivial. 0 not checked. [2018-11-07 22:12:41,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:41,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 12, 12] total 68 [2018-11-07 22:12:41,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:41,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 22:12:41,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 22:12:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 22:12:41,386 INFO L87 Difference]: Start difference. First operand 306 states and 345 transitions. Second operand 58 states. [2018-11-07 22:12:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:42,283 INFO L93 Difference]: Finished difference Result 587 states and 650 transitions. [2018-11-07 22:12:42,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 22:12:42,283 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 153 [2018-11-07 22:12:42,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:42,287 INFO L225 Difference]: With dead ends: 587 [2018-11-07 22:12:42,288 INFO L226 Difference]: Without dead ends: 565 [2018-11-07 22:12:42,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:12:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-11-07 22:12:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 365. [2018-11-07 22:12:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-07 22:12:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 412 transitions. [2018-11-07 22:12:42,296 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 412 transitions. Word has length 153 [2018-11-07 22:12:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:42,297 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 412 transitions. [2018-11-07 22:12:42,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 22:12:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 412 transitions. [2018-11-07 22:12:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-07 22:12:42,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:42,299 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:42,299 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:42,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:42,300 INFO L82 PathProgramCache]: Analyzing trace with hash 752334548, now seen corresponding path program 18 times [2018-11-07 22:12:42,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:42,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:42,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:43,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:43,759 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:43,759 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:43,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:43,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:43,759 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 22:12:43,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:12:43,769 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:12:43,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:12:43,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:43,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:43,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3351 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:47,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:47,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-07 22:12:47,446 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:47,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 22:12:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 22:12:47,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 22:12:47,449 INFO L87 Difference]: Start difference. First operand 365 states and 412 transitions. Second operand 59 states. [2018-11-07 22:12:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:48,565 INFO L93 Difference]: Finished difference Result 542 states and 598 transitions. [2018-11-07 22:12:48,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 22:12:48,569 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 180 [2018-11-07 22:12:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:48,572 INFO L225 Difference]: With dead ends: 542 [2018-11-07 22:12:48,572 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 22:12:48,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2018-11-07 22:12:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 22:12:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 372. [2018-11-07 22:12:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-07 22:12:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 420 transitions. [2018-11-07 22:12:48,580 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 420 transitions. Word has length 180 [2018-11-07 22:12:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:48,581 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 420 transitions. [2018-11-07 22:12:48,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 22:12:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 420 transitions. [2018-11-07 22:12:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 22:12:48,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:48,583 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:48,584 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:48,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash -252635693, now seen corresponding path program 19 times [2018-11-07 22:12:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:48,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:48,585 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:50,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:50,041 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:50,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:50,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:50,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:50,042 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 22:12:50,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:50,051 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:50,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:50,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:54,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:54,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2018-11-07 22:12:54,024 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:54,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 22:12:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 22:12:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2018-11-07 22:12:54,026 INFO L87 Difference]: Start difference. First operand 372 states and 420 transitions. Second operand 60 states. [2018-11-07 22:12:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:55,293 INFO L93 Difference]: Finished difference Result 549 states and 606 transitions. [2018-11-07 22:12:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-07 22:12:55,293 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 183 [2018-11-07 22:12:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:55,297 INFO L225 Difference]: With dead ends: 549 [2018-11-07 22:12:55,297 INFO L226 Difference]: Without dead ends: 543 [2018-11-07 22:12:55,298 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2018-11-07 22:12:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-11-07 22:12:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 379. [2018-11-07 22:12:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 22:12:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 428 transitions. [2018-11-07 22:12:55,306 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 428 transitions. Word has length 183 [2018-11-07 22:12:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:55,306 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 428 transitions. [2018-11-07 22:12:55,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 22:12:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 428 transitions. [2018-11-07 22:12:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-07 22:12:55,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:55,309 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:55,309 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:55,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash 895935092, now seen corresponding path program 20 times [2018-11-07 22:12:55,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:55,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:55,311 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 3636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:57,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:57,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:57,189 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:57,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:57,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:57,189 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 22:12:57,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:57,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:57,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:12:57,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:57,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-11-07 22:12:57,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-11-07 22:12:58,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:58,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 13, 13] total 81 [2018-11-07 22:12:58,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:58,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 22:12:58,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 22:12:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2936, Invalid=3544, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:12:58,272 INFO L87 Difference]: Start difference. First operand 379 states and 428 transitions. Second operand 70 states. [2018-11-07 22:13:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:00,114 INFO L93 Difference]: Finished difference Result 721 states and 797 transitions. [2018-11-07 22:13:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-07 22:13:00,115 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 186 [2018-11-07 22:13:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:00,120 INFO L225 Difference]: With dead ends: 721 [2018-11-07 22:13:00,120 INFO L226 Difference]: Without dead ends: 697 [2018-11-07 22:13:00,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2942, Invalid=3700, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 22:13:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-11-07 22:13:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 445. [2018-11-07 22:13:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-11-07 22:13:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 503 transitions. [2018-11-07 22:13:00,129 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 503 transitions. Word has length 186 [2018-11-07 22:13:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:00,129 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 503 transitions. [2018-11-07 22:13:00,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 22:13:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 503 transitions. [2018-11-07 22:13:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 22:13:00,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:00,132 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:00,133 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:00,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1102113070, now seen corresponding path program 21 times [2018-11-07 22:13:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:00,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:00,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:00,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:00,134 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:02,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:02,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:02,193 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:02,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:02,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:02,193 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 22:13:02,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:02,203 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:02,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:02,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:02,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:02,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5094 backedges. 0 proven. 5094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:07,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:07,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2018-11-07 22:13:07,797 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:07,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-11-07 22:13:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-11-07 22:13:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2018-11-07 22:13:07,799 INFO L87 Difference]: Start difference. First operand 445 states and 503 transitions. Second operand 71 states. [2018-11-07 22:13:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:09,879 INFO L93 Difference]: Finished difference Result 656 states and 724 transitions. [2018-11-07 22:13:09,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 22:13:09,879 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 216 [2018-11-07 22:13:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:09,883 INFO L225 Difference]: With dead ends: 656 [2018-11-07 22:13:09,883 INFO L226 Difference]: Without dead ends: 650 [2018-11-07 22:13:09,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2018-11-07 22:13:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-07 22:13:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 452. [2018-11-07 22:13:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-07 22:13:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 511 transitions. [2018-11-07 22:13:09,893 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 511 transitions. Word has length 216 [2018-11-07 22:13:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:09,894 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 511 transitions. [2018-11-07 22:13:09,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-11-07 22:13:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 511 transitions. [2018-11-07 22:13:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 22:13:09,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:09,896 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:09,897 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:09,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash -518064979, now seen corresponding path program 22 times [2018-11-07 22:13:09,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:09,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:09,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:09,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:09,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:12,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:12,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:12,388 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:12,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:12,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:12,389 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 22:13:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:12,405 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:12,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:12,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5268 backedges. 0 proven. 5268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:17,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:17,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2018-11-07 22:13:17,923 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:17,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-07 22:13:17,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-07 22:13:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2018-11-07 22:13:17,925 INFO L87 Difference]: Start difference. First operand 452 states and 511 transitions. Second operand 72 states. [2018-11-07 22:13:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:20,039 INFO L93 Difference]: Finished difference Result 663 states and 732 transitions. [2018-11-07 22:13:20,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 22:13:20,040 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 219 [2018-11-07 22:13:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:20,044 INFO L225 Difference]: With dead ends: 663 [2018-11-07 22:13:20,044 INFO L226 Difference]: Without dead ends: 657 [2018-11-07 22:13:20,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2018-11-07 22:13:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-07 22:13:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 459. [2018-11-07 22:13:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-11-07 22:13:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 519 transitions. [2018-11-07 22:13:20,053 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 519 transitions. Word has length 219 [2018-11-07 22:13:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:20,054 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 519 transitions. [2018-11-07 22:13:20,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-07 22:13:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 519 transitions. [2018-11-07 22:13:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-07 22:13:20,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:20,056 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:20,056 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:20,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash -399850290, now seen corresponding path program 23 times [2018-11-07 22:13:20,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:20,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 5445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:22,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:22,766 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:22,766 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:22,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:22,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:22,766 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 22:13:22,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:22,777 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:22,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 22:13:22,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:22,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-07 22:13:23,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 5310 trivial. 0 not checked. [2018-11-07 22:13:24,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 14, 14] total 95 [2018-11-07 22:13:24,237 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:24,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-11-07 22:13:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-11-07 22:13:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=4825, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:13:24,239 INFO L87 Difference]: Start difference. First operand 459 states and 519 transitions. Second operand 83 states. [2018-11-07 22:13:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:26,624 INFO L93 Difference]: Finished difference Result 868 states and 958 transitions. [2018-11-07 22:13:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-07 22:13:26,625 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 222 [2018-11-07 22:13:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:26,629 INFO L225 Difference]: With dead ends: 868 [2018-11-07 22:13:26,629 INFO L226 Difference]: Without dead ends: 842 [2018-11-07 22:13:26,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4111, Invalid=5009, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 22:13:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-11-07 22:13:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 532. [2018-11-07 22:13:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-07 22:13:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 602 transitions. [2018-11-07 22:13:26,639 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 602 transitions. Word has length 222 [2018-11-07 22:13:26,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:26,639 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 602 transitions. [2018-11-07 22:13:26,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-11-07 22:13:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 602 transitions. [2018-11-07 22:13:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-07 22:13:26,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:26,642 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:26,642 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:26,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1768862701, now seen corresponding path program 24 times [2018-11-07 22:13:26,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:26,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:26,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:29,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:29,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:29,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:29,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:29,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:29,326 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 22:13:29,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:13:29,334 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:13:29,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:13:29,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:29,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:29,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 0 proven. 7410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:36,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:36,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 166 [2018-11-07 22:13:36,758 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:36,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-07 22:13:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-07 22:13:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2018-11-07 22:13:36,760 INFO L87 Difference]: Start difference. First operand 532 states and 602 transitions. Second operand 84 states. [2018-11-07 22:13:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:39,654 INFO L93 Difference]: Finished difference Result 780 states and 861 transitions. [2018-11-07 22:13:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-07 22:13:39,654 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 255 [2018-11-07 22:13:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:39,657 INFO L225 Difference]: With dead ends: 780 [2018-11-07 22:13:39,658 INFO L226 Difference]: Without dead ends: 774 [2018-11-07 22:13:39,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2018-11-07 22:13:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-11-07 22:13:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 539. [2018-11-07 22:13:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 22:13:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 610 transitions. [2018-11-07 22:13:39,668 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 610 transitions. Word has length 255 [2018-11-07 22:13:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:39,669 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 610 transitions. [2018-11-07 22:13:39,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-07 22:13:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 610 transitions. [2018-11-07 22:13:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-07 22:13:39,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:39,671 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:39,671 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:39,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash 412573620, now seen corresponding path program 25 times [2018-11-07 22:13:39,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:39,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:39,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:13:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:39,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:42,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:42,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:42,597 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:42,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:42,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:42,597 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 22:13:42,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:42,607 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:13:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:42,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:42,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7620 backedges. 0 proven. 7620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:50,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 168 [2018-11-07 22:13:50,256 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:50,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-11-07 22:13:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-11-07 22:13:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2018-11-07 22:13:50,258 INFO L87 Difference]: Start difference. First operand 539 states and 610 transitions. Second operand 85 states. [2018-11-07 22:13:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:13:53,807 INFO L93 Difference]: Finished difference Result 787 states and 869 transitions. [2018-11-07 22:13:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-07 22:13:53,808 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 258 [2018-11-07 22:13:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:13:53,811 INFO L225 Difference]: With dead ends: 787 [2018-11-07 22:13:53,811 INFO L226 Difference]: Without dead ends: 781 [2018-11-07 22:13:53,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2018-11-07 22:13:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-11-07 22:13:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 546. [2018-11-07 22:13:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-07 22:13:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 618 transitions. [2018-11-07 22:13:53,821 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 618 transitions. Word has length 258 [2018-11-07 22:13:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:13:53,822 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 618 transitions. [2018-11-07 22:13:53,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-11-07 22:13:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 618 transitions. [2018-11-07 22:13:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-07 22:13:53,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:13:53,824 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:13:53,824 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:13:53,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:13:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash 431856755, now seen corresponding path program 26 times [2018-11-07 22:13:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:13:53,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:53,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:13:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:13:53,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:13:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:13:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 7833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:13:56,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:56,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:13:56,530 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:13:56,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:13:56,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:13:56,530 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 22:13:56,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:13:56,540 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:13:56,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 22:13:56,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:13:56,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:13:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 7668 trivial. 0 not checked. [2018-11-07 22:13:57,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:13:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 7668 trivial. 0 not checked. [2018-11-07 22:13:58,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:13:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 15, 15] total 110 [2018-11-07 22:13:58,768 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:13:58,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 22:13:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 22:13:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 22:13:58,770 INFO L87 Difference]: Start difference. First operand 546 states and 618 transitions. Second operand 97 states. [2018-11-07 22:14:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:02,881 INFO L93 Difference]: Finished difference Result 1028 states and 1133 transitions. [2018-11-07 22:14:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-07 22:14:02,881 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 261 [2018-11-07 22:14:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:02,884 INFO L225 Difference]: With dead ends: 1028 [2018-11-07 22:14:02,885 INFO L226 Difference]: Without dead ends: 1000 [2018-11-07 22:14:02,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2018-11-07 22:14:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-11-07 22:14:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 626. [2018-11-07 22:14:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-11-07 22:14:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 709 transitions. [2018-11-07 22:14:02,895 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 709 transitions. Word has length 261 [2018-11-07 22:14:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:02,895 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 709 transitions. [2018-11-07 22:14:02,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 22:14:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 709 transitions. [2018-11-07 22:14:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-07 22:14:02,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:02,898 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:02,898 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:02,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1637142579, now seen corresponding path program 27 times [2018-11-07 22:14:02,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:02,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:06,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:06,414 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:06,414 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:06,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:06,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:06,414 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 22:14:06,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:06,422 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:06,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:06,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:06,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:06,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 0 proven. 10407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:16,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:16,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 194 [2018-11-07 22:14:16,835 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:16,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-07 22:14:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-07 22:14:16,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17965, Invalid=19477, Unknown=0, NotChecked=0, Total=37442 [2018-11-07 22:14:16,837 INFO L87 Difference]: Start difference. First operand 626 states and 709 transitions. Second operand 98 states. [2018-11-07 22:14:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:22,238 INFO L93 Difference]: Finished difference Result 914 states and 1009 transitions. [2018-11-07 22:14:22,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-07 22:14:22,239 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 297 [2018-11-07 22:14:22,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:22,244 INFO L225 Difference]: With dead ends: 914 [2018-11-07 22:14:22,244 INFO L226 Difference]: Without dead ends: 908 [2018-11-07 22:14:22,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=17971, Invalid=19859, Unknown=0, NotChecked=0, Total=37830 [2018-11-07 22:14:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-11-07 22:14:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 633. [2018-11-07 22:14:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-07 22:14:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 717 transitions. [2018-11-07 22:14:22,254 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 717 transitions. Word has length 297 [2018-11-07 22:14:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:22,254 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 717 transitions. [2018-11-07 22:14:22,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-11-07 22:14:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 717 transitions. [2018-11-07 22:14:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-07 22:14:22,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:22,257 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:22,257 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:22,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1112549934, now seen corresponding path program 28 times [2018-11-07 22:14:22,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:22,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:22,259 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:25,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:25,903 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:25,903 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:25,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:25,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:25,903 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 22:14:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:25,913 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:26,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:26,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10656 backedges. 0 proven. 10656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:36,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:36,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 196 [2018-11-07 22:14:36,195 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:36,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-07 22:14:36,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-07 22:14:36,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18346, Invalid=19874, Unknown=0, NotChecked=0, Total=38220 [2018-11-07 22:14:36,197 INFO L87 Difference]: Start difference. First operand 633 states and 717 transitions. Second operand 99 states. [2018-11-07 22:14:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:41,493 INFO L93 Difference]: Finished difference Result 921 states and 1017 transitions. [2018-11-07 22:14:41,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-07 22:14:41,494 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 300 [2018-11-07 22:14:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:41,499 INFO L225 Difference]: With dead ends: 921 [2018-11-07 22:14:41,499 INFO L226 Difference]: Without dead ends: 915 [2018-11-07 22:14:41,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 503 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18352, Invalid=20260, Unknown=0, NotChecked=0, Total=38612 [2018-11-07 22:14:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-11-07 22:14:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 640. [2018-11-07 22:14:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-07 22:14:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2018-11-07 22:14:41,510 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 300 [2018-11-07 22:14:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:41,510 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2018-11-07 22:14:41,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-11-07 22:14:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2018-11-07 22:14:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-07 22:14:41,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:41,513 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:41,513 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:41,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash -709031891, now seen corresponding path program 29 times [2018-11-07 22:14:41,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:41,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 10908 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:45,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:45,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:45,346 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:45,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:45,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:45,347 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 22:14:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:45,355 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:45,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:14:45,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:45,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 10710 trivial. 0 not checked. [2018-11-07 22:14:47,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10908 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 10710 trivial. 0 not checked. [2018-11-07 22:14:48,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:48,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 16, 16] total 126 [2018-11-07 22:14:48,433 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:48,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-11-07 22:14:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-11-07 22:14:48,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2018-11-07 22:14:48,436 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. Second operand 112 states. [2018-11-07 22:14:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:53,616 INFO L93 Difference]: Finished difference Result 1201 states and 1322 transitions. [2018-11-07 22:14:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-11-07 22:14:53,617 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 303 [2018-11-07 22:14:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:53,621 INFO L225 Difference]: With dead ends: 1201 [2018-11-07 22:14:53,621 INFO L226 Difference]: Without dead ends: 1171 [2018-11-07 22:14:53,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 580 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2018-11-07 22:14:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-11-07 22:14:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 727. [2018-11-07 22:14:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-07 22:14:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 824 transitions. [2018-11-07 22:14:53,635 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 824 transitions. Word has length 303 [2018-11-07 22:14:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:53,635 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 824 transitions. [2018-11-07 22:14:53,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-11-07 22:14:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 824 transitions. [2018-11-07 22:14:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-07 22:14:53,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:53,638 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:53,639 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:53,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:53,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1992803276, now seen corresponding path program 30 times [2018-11-07 22:14:53,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:53,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:53,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:53,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:53,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:58,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:58,815 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:58,816 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:58,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:58,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:58,816 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 22:14:58,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:58,824 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:58,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:58,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:58,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:59,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14202 backedges. 0 proven. 14202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:11,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:11,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 206 [2018-11-07 22:15:11,721 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:11,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-11-07 22:15:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-11-07 22:15:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20311, Invalid=21919, Unknown=0, NotChecked=0, Total=42230 [2018-11-07 22:15:11,724 INFO L87 Difference]: Start difference. First operand 727 states and 824 transitions. Second operand 113 states. [2018-11-07 22:15:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:19,846 INFO L93 Difference]: Finished difference Result 893 states and 1003 transitions. [2018-11-07 22:15:19,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-11-07 22:15:19,846 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 342 [2018-11-07 22:15:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:19,851 INFO L225 Difference]: With dead ends: 893 [2018-11-07 22:15:19,852 INFO L226 Difference]: Without dead ends: 887 [2018-11-07 22:15:19,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 573 SyntacticMatches, 19 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=20317, Invalid=22325, Unknown=0, NotChecked=0, Total=42642 [2018-11-07 22:15:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-11-07 22:15:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 734. [2018-11-07 22:15:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-07 22:15:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 832 transitions. [2018-11-07 22:15:19,867 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 832 transitions. Word has length 342 [2018-11-07 22:15:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:19,868 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 832 transitions. [2018-11-07 22:15:19,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-11-07 22:15:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 832 transitions. [2018-11-07 22:15:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-07 22:15:19,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:19,871 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:19,872 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:19,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash -294769805, now seen corresponding path program 31 times [2018-11-07 22:15:19,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:19,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:19,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:19,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:19,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:25,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:25,686 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:25,686 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:25,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:15:25,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:25,686 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 22:15:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:25,694 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:25,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:26,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14493 backedges. 0 proven. 14493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 206 [2018-11-07 22:15:38,406 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-11-07 22:15:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-11-07 22:15:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20311, Invalid=21919, Unknown=0, NotChecked=0, Total=42230 [2018-11-07 22:15:38,409 INFO L87 Difference]: Start difference. First operand 734 states and 832 transitions. Second operand 114 states. [2018-11-07 22:15:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:45,433 INFO L93 Difference]: Finished difference Result 867 states and 978 transitions. [2018-11-07 22:15:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-11-07 22:15:45,433 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 345 [2018-11-07 22:15:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:45,437 INFO L225 Difference]: With dead ends: 867 [2018-11-07 22:15:45,437 INFO L226 Difference]: Without dead ends: 861 [2018-11-07 22:15:45,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 578 SyntacticMatches, 21 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2805 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=20317, Invalid=22325, Unknown=0, NotChecked=0, Total=42642 [2018-11-07 22:15:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-07 22:15:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 741. [2018-11-07 22:15:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-11-07 22:15:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 840 transitions. [2018-11-07 22:15:45,449 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 840 transitions. Word has length 345 [2018-11-07 22:15:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:45,449 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 840 transitions. [2018-11-07 22:15:45,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-11-07 22:15:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 840 transitions. [2018-11-07 22:15:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-07 22:15:45,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:45,452 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:45,453 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:45,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -304447532, now seen corresponding path program 32 times [2018-11-07 22:15:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:45,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:45,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 14787 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:15:50,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:50,078 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:50,078 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:50,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:15:50,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:50,078 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 22:15:50,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:50,087 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:50,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-07 22:15:50,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:50,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 14553 trivial. 0 not checked. [2018-11-07 22:15:51,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14787 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 14553 trivial. 0 not checked. [2018-11-07 22:15:52,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:52,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 17, 17] total 131 [2018-11-07 22:15:52,744 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:52,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-11-07 22:15:52,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-11-07 22:15:52,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8011, Invalid=9019, Unknown=0, NotChecked=0, Total=17030 [2018-11-07 22:15:52,746 INFO L87 Difference]: Start difference. First operand 741 states and 840 transitions. Second operand 116 states. [2018-11-07 22:16:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:16:00,362 INFO L93 Difference]: Finished difference Result 847 states and 961 transitions. [2018-11-07 22:16:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-11-07 22:16:00,362 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 348 [2018-11-07 22:16:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:16:00,366 INFO L225 Difference]: With dead ends: 847 [2018-11-07 22:16:00,366 INFO L226 Difference]: Without dead ends: 839 [2018-11-07 22:16:00,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 679 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8017, Invalid=9275, Unknown=0, NotChecked=0, Total=17292 [2018-11-07 22:16:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-11-07 22:16:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 751. [2018-11-07 22:16:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-11-07 22:16:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 851 transitions. [2018-11-07 22:16:00,377 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 851 transitions. Word has length 348 [2018-11-07 22:16:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:16:00,378 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 851 transitions. [2018-11-07 22:16:00,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-11-07 22:16:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 851 transitions. [2018-11-07 22:16:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-07 22:16:00,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:16:00,382 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:16:00,383 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:16:00,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:16:00,384 INFO L82 PathProgramCache]: Analyzing trace with hash -127276786, now seen corresponding path program 33 times [2018-11-07 22:16:00,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:16:00,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:00,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:16:00,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:00,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:16:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:16:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15123 backedges. 0 proven. 15123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:16:05,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:16:05,373 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:16:05,374 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:16:05,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:16:05,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:16:05,374 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:16:05,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:16:05,384 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:16:05,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:16:05,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:16:05,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-11-07 22:16:05,840 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 22:16:06,040 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:16:06,041 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:16:06,046 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:16:06,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:16:06 BoogieIcfgContainer [2018-11-07 22:16:06,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:16:06,047 INFO L168 Benchmark]: Toolchain (without parser) took 244217.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -158.8 MB). Peak memory consumption was 616.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:16:06,049 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:16:06,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:16:06,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:16:06,050 INFO L168 Benchmark]: Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:16:06,050 INFO L168 Benchmark]: RCFGBuilder took 470.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:16:06,051 INFO L168 Benchmark]: TraceAbstraction took 243351.47 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 28.3 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 630.5 MB). Peak memory consumption was 658.9 MB. Max. memory is 7.1 GB. [2018-11-07 22:16:06,054 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 470.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243351.47 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 28.3 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 630.5 MB). Peak memory consumption was 658.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 355 with TraceHistMax 100,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 117 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 243.2s OverallTime, 37 OverallIterations, 100 TraceHistogramMax, 68.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 13419 SDslu, 15498 SDs, 0 SdLazy, 10671 SolverSat, 4333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12672 GetRequests, 9564 SyntacticMatches, 72 SemanticMatches, 3036 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15512 ImplicationChecksByTransitivity, 159.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 4989 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 163.1s InterpolantComputationTime, 10931 NumberOfCodeBlocks, 9743 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 16268 ConstructedInterpolants, 0 QuantifiedInterpolants, 9423888 SizeOfPredicates, 78 NumberOfNonLiveVariables, 10115 ConjunctsInSsa, 1373 ConjunctsInUnsatCore, 102 InterpolantComputations, 3 PerfectInterpolantSequences, 92865/414984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown