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-EXP.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:42:43,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:42:43,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:42:43,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:42:43,173 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:42:43,174 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:42:43,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:42:43,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:42:43,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:42:43,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:42:43,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:42:43,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:42:43,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:42:43,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:42:43,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:42:43,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:42:43,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:42:43,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:42:43,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:42:43,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:42:43,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:42:43,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:42:43,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:42:43,198 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:42:43,198 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:42:43,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:42:43,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:42:43,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:42:43,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:42:43,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:42:43,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:42:43,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:42:43,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:42:43,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:42:43,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:42:43,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:42:43,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:42:43,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:42:43,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:42:43,225 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:42:43,225 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:42:43,225 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:42:43,225 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:42:43,225 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:42:43,226 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:42:43,226 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:42:43,226 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:42:43,226 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:42:43,226 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:42:43,227 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:42:43,227 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:42:43,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:42:43,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:42:43,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:42:43,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:42:43,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:42:43,229 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:42:43,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:42:43,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:42:43,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:42:43,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:42:43,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:42:43,231 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:42:43,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:42:43,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:42:43,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:42:43,232 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:42:43,232 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:42:43,232 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:42:43,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:42:43,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:42:43,233 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:42:43,233 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:42:43,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:42:43,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:42:43,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:42:43,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:42:43,314 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:42:43,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-07 10:42:43,379 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a666da6/e7df9a4576344299987d7f40df3abe65/FLAG8ceb46ce6 [2018-11-07 10:42:43,925 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:42:43,925 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-07 10:42:43,936 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a666da6/e7df9a4576344299987d7f40df3abe65/FLAG8ceb46ce6 [2018-11-07 10:42:43,956 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a666da6/e7df9a4576344299987d7f40df3abe65 [2018-11-07 10:42:43,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:42:43,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:42:43,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:42:43,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:42:43,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:42:43,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:43" (1/1) ... [2018-11-07 10:42:43,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7364f84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43, skipping insertion in model container [2018-11-07 10:42:43,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:43" (1/1) ... [2018-11-07 10:42:43,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:42:44,011 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:42:44,226 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:42:44,230 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:42:44,250 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:42:44,268 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:42:44,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44 WrapperNode [2018-11-07 10:42:44,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:42:44,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:42:44,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:42:44,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:42:44,280 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:42:44" (1/1) ... [2018-11-07 10:42:44,289 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:42:44" (1/1) ... [2018-11-07 10:42:44,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:42:44,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:42:44,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:42:44,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:42:44,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (1/1) ... [2018-11-07 10:42:44,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (1/1) ... [2018-11-07 10:42:44,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (1/1) ... [2018-11-07 10:42:44,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (1/1) ... [2018-11-07 10:42:44,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (1/1) ... [2018-11-07 10:42:44,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (1/1) ... [2018-11-07 10:42:44,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (1/1) ... [2018-11-07 10:42:44,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:42:44,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:42:44,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:42:44,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:42:44,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (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 10:42:44,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:42:44,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:42:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:42:44,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:42:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:42:44,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:42:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:42:44,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:42:44,697 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:42:44,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:44 BoogieIcfgContainer [2018-11-07 10:42:44,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:42:44,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:42:44,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:42:44,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:42:44,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:42:43" (1/3) ... [2018-11-07 10:42:44,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740dc510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:44, skipping insertion in model container [2018-11-07 10:42:44,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:44" (2/3) ... [2018-11-07 10:42:44,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740dc510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:44, skipping insertion in model container [2018-11-07 10:42:44,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:44" (3/3) ... [2018-11-07 10:42:44,706 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono5_false-unreach-call1.c [2018-11-07 10:42:44,717 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:42:44,725 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:42:44,748 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:42:44,802 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:42:44,802 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:42:44,802 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:42:44,803 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:42:44,803 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:42:44,803 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:42:44,804 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:42:44,804 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:42:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 10:42:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:42:44,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:44,846 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:44,849 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:44,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:44,856 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-07 10:42:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,922 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,020 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 10:42:45,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:45,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:42:45,023 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:45,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:42:45,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:42:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:42:45,042 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 10:42:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:45,066 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 10:42:45,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:42:45,067 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:42:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:45,079 INFO L225 Difference]: With dead ends: 31 [2018-11-07 10:42:45,079 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 10:42:45,084 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 10:42:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 10:42:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 10:42:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 10:42:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-07 10:42:45,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-07 10:42:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:45,122 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-07 10:42:45,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:42:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-07 10:42:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:42:45,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:45,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:45,124 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:45,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-07 10:42:45,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:45,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,289 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 10:42:45,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:45,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:42:45,290 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:45,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:42:45,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:42:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:42:45,293 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-07 10:42:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:45,374 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-07 10:42:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:42:45,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-07 10:42:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:45,376 INFO L225 Difference]: With dead ends: 23 [2018-11-07 10:42:45,377 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 10:42:45,378 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 10:42:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 10:42:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 10:42:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 10:42:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-07 10:42:45,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-07 10:42:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:45,385 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-07 10:42:45,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:42:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-07 10:42:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:42:45,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:45,387 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:45,388 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:45,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-07 10:42:45,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:45,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:45,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:45,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:42:45,486 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:45,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:42:45,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:42:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:42:45,487 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2018-11-07 10:42:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:45,546 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 10:42:45,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:42:45,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 10:42:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:45,551 INFO L225 Difference]: With dead ends: 31 [2018-11-07 10:42:45,551 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 10:42:45,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:42:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 10:42:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 10:42:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:42:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-07 10:42:45,561 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-07 10:42:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:45,563 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-07 10:42:45,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:42:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-07 10:42:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:42:45,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:45,564 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:45,564 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:45,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1263790289, now seen corresponding path program 1 times [2018-11-07 10:42:45,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:45,817 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-07 10:42:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:45,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:45,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:45,837 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-07 10:42:45,839 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 10:42:45,878 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:42:45,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:42:46,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:42:46,105 INFO L272 AbstractInterpreter]: Visited 15 different actions 54 times. Merged at 6 different actions 22 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-07 10:42:46,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:46,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:42:46,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:46,124 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 10:42:46,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:46,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:46,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:46,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:46,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:46,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2018-11-07 10:42:46,308 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:46,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:42:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:42:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:42:46,310 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-07 10:42:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:46,461 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-07 10:42:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:42:46,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 10:42:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:46,465 INFO L225 Difference]: With dead ends: 35 [2018-11-07 10:42:46,465 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 10:42:46,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:42:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 10:42:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-07 10:42:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 10:42:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 10:42:46,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-07 10:42:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:46,477 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 10:42:46,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:42:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 10:42:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:42:46,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:46,479 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:46,479 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:46,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash -375813959, now seen corresponding path program 2 times [2018-11-07 10:42:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:46,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:46,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:46,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:46,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:46,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:46,688 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:46,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:46,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:46,689 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 10:42:46,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:46,700 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:46,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:42:46,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:46,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:46,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:47,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:47,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-11-07 10:42:47,182 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:47,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:42:47,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:42:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:42:47,187 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-11-07 10:42:47,522 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 10:42:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:47,810 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-07 10:42:47,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:42:47,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-07 10:42:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:47,813 INFO L225 Difference]: With dead ends: 46 [2018-11-07 10:42:47,813 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 10:42:47,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:42:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 10:42:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 10:42:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:42:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-07 10:42:47,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-11-07 10:42:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:47,821 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-07 10:42:47,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:42:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-07 10:42:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:42:47,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:47,822 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:47,823 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:47,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:47,823 INFO L82 PathProgramCache]: Analyzing trace with hash 60088779, now seen corresponding path program 3 times [2018-11-07 10:42:47,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:47,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:47,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:47,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:48,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:48,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:48,006 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:48,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:48,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:48,006 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 10:42:48,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:48,016 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:48,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:48,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:48,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:48,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:48,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2018-11-07 10:42:48,239 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:48,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:42:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:42:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:42:48,241 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-11-07 10:42:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:48,393 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-07 10:42:48,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:42:48,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-07 10:42:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:48,395 INFO L225 Difference]: With dead ends: 55 [2018-11-07 10:42:48,395 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 10:42:48,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:42:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 10:42:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-07 10:42:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 10:42:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-07 10:42:48,402 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 31 [2018-11-07 10:42:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:48,403 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-07 10:42:48,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:42:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-07 10:42:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 10:42:48,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:48,404 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:48,404 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:48,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash -113592933, now seen corresponding path program 4 times [2018-11-07 10:42:48,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:48,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:48,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:48,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:48,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:48,849 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:48,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:48,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:48,849 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 10:42:48,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:48,864 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:48,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:48,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:49,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:49,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2018-11-07 10:42:49,082 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:49,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:42:49,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:42:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:42:49,084 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-11-07 10:42:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:49,378 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-07 10:42:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:42:49,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-07 10:42:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:49,380 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:42:49,380 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 10:42:49,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:42:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 10:42:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-07 10:42:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 10:42:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-07 10:42:49,388 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 39 [2018-11-07 10:42:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:49,389 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-07 10:42:49,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:42:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-07 10:42:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:42:49,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:49,391 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:49,391 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:49,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1492629867, now seen corresponding path program 5 times [2018-11-07 10:42:49,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:49,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:49,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:49,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:49,647 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:49,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:49,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:49,648 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 10:42:49,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:49,663 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:49,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:42:49,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:49,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:42:49,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:42:50,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:50,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 22 [2018-11-07 10:42:50,083 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:50,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:42:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:42:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:42:50,084 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 17 states. [2018-11-07 10:42:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:50,840 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-07 10:42:50,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:42:50,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-11-07 10:42:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:50,843 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:42:50,843 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 10:42:50,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-11-07 10:42:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 10:42:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-07 10:42:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 10:42:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-07 10:42:50,852 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 47 [2018-11-07 10:42:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:50,853 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-07 10:42:50,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:42:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-07 10:42:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:42:50,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:50,855 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:50,855 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:50,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash -642646683, now seen corresponding path program 6 times [2018-11-07 10:42:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:50,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:50,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:50,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 35 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:51,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:51,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:51,179 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:51,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:51,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:51,180 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 10:42:51,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:51,189 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:51,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:51,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:51,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 107 proven. 171 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:51,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 107 proven. 171 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:51,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:51,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 25 [2018-11-07 10:42:51,628 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:51,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 10:42:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 10:42:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:42:51,631 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 15 states. [2018-11-07 10:42:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:52,075 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-07 10:42:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:42:52,076 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-07 10:42:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:52,077 INFO L225 Difference]: With dead ends: 91 [2018-11-07 10:42:52,078 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 10:42:52,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:42:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 10:42:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-07 10:42:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-07 10:42:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-07 10:42:52,087 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 59 [2018-11-07 10:42:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:52,087 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-07 10:42:52,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 10:42:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-07 10:42:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 10:42:52,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:52,090 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:52,090 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:52,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash 733358365, now seen corresponding path program 7 times [2018-11-07 10:42:52,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:52,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:52,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:52,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:52,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 44 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:52,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:52,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:52,900 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:52,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:52,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:52,900 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 10:42:52,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:52,909 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:52,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 140 proven. 300 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:53,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 140 proven. 300 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:53,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:53,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 31 [2018-11-07 10:42:53,656 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:53,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 10:42:53,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 10:42:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=648, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:42:53,658 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 18 states. [2018-11-07 10:42:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:54,417 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-07 10:42:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:42:54,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-07 10:42:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:54,422 INFO L225 Difference]: With dead ends: 103 [2018-11-07 10:42:54,422 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 10:42:54,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=282, Invalid=648, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:42:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 10:42:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-07 10:42:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-07 10:42:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-07 10:42:54,443 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 71 [2018-11-07 10:42:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:54,443 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-07 10:42:54,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 10:42:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-07 10:42:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 10:42:54,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:54,445 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:54,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:54,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:54,446 INFO L82 PathProgramCache]: Analyzing trace with hash 134119637, now seen corresponding path program 8 times [2018-11-07 10:42:54,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:54,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:54,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 53 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:57,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:57,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:57,764 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:57,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:57,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:57,764 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 10:42:57,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:57,775 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:57,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:42:57,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:57,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-07 10:42:57,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-07 10:42:58,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:58,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 33 [2018-11-07 10:42:58,162 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:58,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 10:42:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 10:42:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:42:58,163 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 27 states. [2018-11-07 10:43:00,114 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 10:43:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:00,575 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-11-07 10:43:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:43:00,576 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-07 10:43:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:00,578 INFO L225 Difference]: With dead ends: 122 [2018-11-07 10:43:00,578 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 10:43:00,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:43:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 10:43:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-07 10:43:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-07 10:43:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-07 10:43:00,591 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 83 [2018-11-07 10:43:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:00,591 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-07 10:43:00,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 10:43:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-07 10:43:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 10:43:00,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:00,593 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:00,593 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:00,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1864426569, now seen corresponding path program 9 times [2018-11-07 10:43:00,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:00,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:00,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 65 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:01,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:01,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:01,331 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:01,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:01,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:01,331 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 10:43:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:01,339 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:01,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:01,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:01,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 281 proven. 666 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:01,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 281 proven. 666 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:02,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:02,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 44 [2018-11-07 10:43:02,623 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:02,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:43:02,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:43:02,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:43:02,624 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 25 states. [2018-11-07 10:43:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:03,917 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-11-07 10:43:03,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:43:03,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-07 10:43:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:03,919 INFO L225 Difference]: With dead ends: 139 [2018-11-07 10:43:03,919 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 10:43:03,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:43:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 10:43:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-07 10:43:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 10:43:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-11-07 10:43:03,931 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 99 [2018-11-07 10:43:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:03,932 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-11-07 10:43:03,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:43:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-11-07 10:43:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 10:43:03,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:03,934 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 22, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:03,934 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:03,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1480580265, now seen corresponding path program 10 times [2018-11-07 10:43:03,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:03,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:03,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:03,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 77 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:04,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:04,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:04,629 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:04,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:04,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:04,629 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 10:43:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:04,638 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:04,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 341 proven. 990 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:04,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 341 proven. 990 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:06,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 52 [2018-11-07 10:43:06,089 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:06,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 10:43:06,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 10:43:06,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=1904, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:43:06,092 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 29 states. [2018-11-07 10:43:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:07,567 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-11-07 10:43:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 10:43:07,570 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-07 10:43:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:07,571 INFO L225 Difference]: With dead ends: 155 [2018-11-07 10:43:07,571 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 10:43:07,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=748, Invalid=1904, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 10:43:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 10:43:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-11-07 10:43:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-07 10:43:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-11-07 10:43:07,585 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 115 [2018-11-07 10:43:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:07,586 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-11-07 10:43:07,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 10:43:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-11-07 10:43:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 10:43:07,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:07,588 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:07,588 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:07,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash -337777929, now seen corresponding path program 11 times [2018-11-07 10:43:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:07,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:07,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 89 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:08,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:08,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:08,612 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:08,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:08,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:08,612 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 10:43:08,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:08,621 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:08,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:43:08,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:08,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-07 10:43:08,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-07 10:43:09,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:09,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 9] total 47 [2018-11-07 10:43:09,345 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:09,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:43:09,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:43:09,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 10:43:09,347 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 40 states. [2018-11-07 10:43:09,894 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 10:43:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:12,640 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2018-11-07 10:43:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:43:12,640 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 131 [2018-11-07 10:43:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:12,642 INFO L225 Difference]: With dead ends: 178 [2018-11-07 10:43:12,643 INFO L226 Difference]: Without dead ends: 154 [2018-11-07 10:43:12,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=454, Invalid=5552, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 10:43:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-07 10:43:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-07 10:43:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 10:43:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2018-11-07 10:43:12,655 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 131 [2018-11-07 10:43:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:12,656 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2018-11-07 10:43:12,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:43:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2018-11-07 10:43:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 10:43:12,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:12,659 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 30, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:12,659 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:12,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash 504657089, now seen corresponding path program 12 times [2018-11-07 10:43:12,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:12,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:12,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 104 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:14,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:14,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:14,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:14,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:14,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:14,088 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 10:43:14,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:14,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:14,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:14,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:14,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 476 proven. 1953 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:14,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 476 proven. 1953 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 70 [2018-11-07 10:43:16,857 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:16,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 10:43:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 10:43:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1324, Invalid=3506, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 10:43:16,860 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 38 states. [2018-11-07 10:43:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:19,272 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2018-11-07 10:43:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 10:43:19,272 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-07 10:43:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:19,274 INFO L225 Difference]: With dead ends: 199 [2018-11-07 10:43:19,274 INFO L226 Difference]: Without dead ends: 174 [2018-11-07 10:43:19,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1324, Invalid=3506, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 10:43:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-07 10:43:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-11-07 10:43:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-07 10:43:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 179 transitions. [2018-11-07 10:43:19,286 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 179 transitions. Word has length 151 [2018-11-07 10:43:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:19,287 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 179 transitions. [2018-11-07 10:43:19,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 10:43:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2018-11-07 10:43:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 10:43:19,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:19,289 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 35, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:19,289 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:19,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1798768713, now seen corresponding path program 13 times [2018-11-07 10:43:19,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:19,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:19,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:19,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:19,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 119 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:20,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:20,976 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:20,976 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:20,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:20,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:20,977 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 10:43:20,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:20,985 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:21,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 679 proven. 2485 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:43:21,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 679 proven. 2485 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:43:24,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:24,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 79 [2018-11-07 10:43:24,426 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:24,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 10:43:24,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 10:43:24,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:43:24,429 INFO L87 Difference]: Start difference. First operand 173 states and 179 transitions. Second operand 43 states. [2018-11-07 10:43:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:27,840 INFO L93 Difference]: Finished difference Result 219 states and 235 transitions. [2018-11-07 10:43:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:43:27,842 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2018-11-07 10:43:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:27,844 INFO L225 Difference]: With dead ends: 219 [2018-11-07 10:43:27,844 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 10:43:27,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:43:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 10:43:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-11-07 10:43:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-07 10:43:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 199 transitions. [2018-11-07 10:43:27,854 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 199 transitions. Word has length 171 [2018-11-07 10:43:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:27,855 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 199 transitions. [2018-11-07 10:43:27,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 10:43:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 199 transitions. [2018-11-07 10:43:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 10:43:27,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:27,858 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 40, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:27,858 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:27,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1502906321, now seen corresponding path program 14 times [2018-11-07 10:43:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:27,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 134 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:29,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:29,323 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:29,323 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:29,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:29,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:29,323 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 10:43:29,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:29,332 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:29,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:43:29,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:29,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 810 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:43:29,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 810 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 10:43:30,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:30,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 10, 10] total 64 [2018-11-07 10:43:30,361 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:30,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 10:43:30,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 10:43:30,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3824, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 10:43:30,363 INFO L87 Difference]: Start difference. First operand 193 states and 199 transitions. Second operand 56 states. [2018-11-07 10:43:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:37,069 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2018-11-07 10:43:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 10:43:37,069 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 191 [2018-11-07 10:43:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:37,072 INFO L225 Difference]: With dead ends: 246 [2018-11-07 10:43:37,072 INFO L226 Difference]: Without dead ends: 218 [2018-11-07 10:43:37,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=709, Invalid=11281, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 10:43:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-07 10:43:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-11-07 10:43:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-07 10:43:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 224 transitions. [2018-11-07 10:43:37,084 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 224 transitions. Word has length 191 [2018-11-07 10:43:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:37,085 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 224 transitions. [2018-11-07 10:43:37,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 10:43:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 224 transitions. [2018-11-07 10:43:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 10:43:37,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:37,088 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 45, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:37,088 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:37,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:37,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1605843837, now seen corresponding path program 15 times [2018-11-07 10:43:37,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:37,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:37,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:37,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:37,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 152 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:39,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:39,405 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:39,405 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:39,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:39,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:39,406 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 10:43:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:39,414 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:39,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:39,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:39,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 1052 proven. 4095 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 10:43:39,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 1052 proven. 4095 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 10:43:44,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:44,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 48, 48] total 100 [2018-11-07 10:43:44,500 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:44,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 10:43:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 10:43:44,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=7260, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 10:43:44,502 INFO L87 Difference]: Start difference. First operand 217 states and 224 transitions. Second operand 54 states. [2018-11-07 10:43:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:49,565 INFO L93 Difference]: Finished difference Result 271 states and 290 transitions. [2018-11-07 10:43:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 10:43:49,566 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 215 [2018-11-07 10:43:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:49,568 INFO L225 Difference]: With dead ends: 271 [2018-11-07 10:43:49,568 INFO L226 Difference]: Without dead ends: 242 [2018-11-07 10:43:49,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 384 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2640, Invalid=7260, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 10:43:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-07 10:43:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-11-07 10:43:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-07 10:43:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 248 transitions. [2018-11-07 10:43:49,577 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 248 transitions. Word has length 215 [2018-11-07 10:43:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:49,577 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 248 transitions. [2018-11-07 10:43:49,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 10:43:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 248 transitions. [2018-11-07 10:43:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-07 10:43:49,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:49,579 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 51, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:49,579 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:49,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1571831821, now seen corresponding path program 16 times [2018-11-07 10:43:49,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:49,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:49,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 170 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:51,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:51,803 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:51,804 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:51,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:51,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:51,804 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 10:43:51,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:51,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:51,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 1190 proven. 5253 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 10:43:51,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 1190 proven. 5253 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 10:43:58,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:58,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 54, 54] total 112 [2018-11-07 10:43:58,201 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:58,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 10:43:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 10:43:58,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3294, Invalid=9138, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 10:43:58,204 INFO L87 Difference]: Start difference. First operand 241 states and 248 transitions. Second operand 60 states. [2018-11-07 10:44:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:04,531 INFO L93 Difference]: Finished difference Result 295 states and 314 transitions. [2018-11-07 10:44:04,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 10:44:04,532 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 239 [2018-11-07 10:44:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:04,534 INFO L225 Difference]: With dead ends: 295 [2018-11-07 10:44:04,534 INFO L226 Difference]: Without dead ends: 266 [2018-11-07 10:44:04,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3294, Invalid=9138, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 10:44:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-07 10:44:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-11-07 10:44:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-07 10:44:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 272 transitions. [2018-11-07 10:44:04,544 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 272 transitions. Word has length 239 [2018-11-07 10:44:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:04,545 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 272 transitions. [2018-11-07 10:44:04,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 10:44:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 272 transitions. [2018-11-07 10:44:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 10:44:04,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:04,547 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 57, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:04,547 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:04,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1560843421, now seen corresponding path program 17 times [2018-11-07 10:44:04,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:04,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:04,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:04,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 188 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:06,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:06,778 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:06,779 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:06,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:06,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:06,779 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 10:44:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:06,787 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:22,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:44:22,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:23,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 0 proven. 1383 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2018-11-07 10:44:23,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 0 proven. 1383 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2018-11-07 10:44:24,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:24,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 11, 11] total 84 [2018-11-07 10:44:24,544 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:24,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 10:44:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 10:44:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6693, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 10:44:24,546 INFO L87 Difference]: Start difference. First operand 265 states and 272 transitions. Second operand 75 states. [2018-11-07 10:44:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:36,658 INFO L93 Difference]: Finished difference Result 326 states and 347 transitions. [2018-11-07 10:44:36,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-07 10:44:36,658 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 263 [2018-11-07 10:44:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:36,661 INFO L225 Difference]: With dead ends: 326 [2018-11-07 10:44:36,661 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 10:44:36,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1041, Invalid=20715, Unknown=0, NotChecked=0, Total=21756 [2018-11-07 10:44:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 10:44:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-11-07 10:44:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-07 10:44:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 301 transitions. [2018-11-07 10:44:36,676 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 301 transitions. Word has length 263 [2018-11-07 10:44:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:36,677 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 301 transitions. [2018-11-07 10:44:36,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 10:44:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 301 transitions. [2018-11-07 10:44:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-07 10:44:36,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:36,679 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 63, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:36,679 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:36,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1494174461, now seen corresponding path program 18 times [2018-11-07 10:44:36,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:36,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:36,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:36,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:36,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 209 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:40,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:40,175 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:40,175 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:40,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:40,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:40,175 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 10:44:40,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:44:40,184 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:44:40,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:44:40,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:40,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 1721 proven. 8001 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 10:44:40,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 1721 proven. 8001 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 10:44:49,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:49,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 66, 66] total 137 [2018-11-07 10:44:49,880 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:49,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 10:44:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 10:44:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4885, Invalid=13747, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 10:44:49,881 INFO L87 Difference]: Start difference. First operand 293 states and 301 transitions. Second operand 73 states. [2018-11-07 10:44:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:59,368 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions. [2018-11-07 10:44:59,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 10:44:59,369 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 291 [2018-11-07 10:44:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:59,371 INFO L225 Difference]: With dead ends: 355 [2018-11-07 10:44:59,371 INFO L226 Difference]: Without dead ends: 322 [2018-11-07 10:44:59,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 518 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=4885, Invalid=13747, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 10:44:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-07 10:44:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-11-07 10:44:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-07 10:44:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 329 transitions. [2018-11-07 10:44:59,382 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 329 transitions. Word has length 291 [2018-11-07 10:44:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:59,383 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 329 transitions. [2018-11-07 10:44:59,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 10:44:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 329 transitions. [2018-11-07 10:44:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-07 10:44:59,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:59,385 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 70, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:59,385 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:59,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:59,385 INFO L82 PathProgramCache]: Analyzing trace with hash 348763733, now seen corresponding path program 19 times [2018-11-07 10:44:59,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:59,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:59,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 230 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:02,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:02,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:02,984 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:02,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:02,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:02,984 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 10:45:02,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:02,993 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:45:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:03,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 1910 proven. 9870 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 10:45:03,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 1910 proven. 9870 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 10:45:14,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:14,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 73, 73] total 151 [2018-11-07 10:45:14,061 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:14,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-07 10:45:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-07 10:45:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5914, Invalid=16736, Unknown=0, NotChecked=0, Total=22650 [2018-11-07 10:45:14,063 INFO L87 Difference]: Start difference. First operand 321 states and 329 transitions. Second operand 80 states. [2018-11-07 10:45:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:25,773 INFO L93 Difference]: Finished difference Result 383 states and 405 transitions. [2018-11-07 10:45:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-07 10:45:25,777 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 319 [2018-11-07 10:45:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:25,779 INFO L225 Difference]: With dead ends: 383 [2018-11-07 10:45:25,779 INFO L226 Difference]: Without dead ends: 350 [2018-11-07 10:45:25,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 567 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=5914, Invalid=16736, Unknown=0, NotChecked=0, Total=22650 [2018-11-07 10:45:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-07 10:45:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-11-07 10:45:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-07 10:45:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 357 transitions. [2018-11-07 10:45:25,791 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 357 transitions. Word has length 319 [2018-11-07 10:45:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:25,792 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 357 transitions. [2018-11-07 10:45:25,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-07 10:45:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 357 transitions. [2018-11-07 10:45:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-07 10:45:25,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:25,794 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 77, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:25,795 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:25,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash -310628947, now seen corresponding path program 20 times [2018-11-07 10:45:25,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:25,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:25,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 251 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:31,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:31,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:31,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:31,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:31,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:31,250 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 10:45:31,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:45:31,258 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:45:34,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:45:34,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:34,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 0 proven. 2177 refuted. 0 times theorem prover too weak. 11935 trivial. 0 not checked. [2018-11-07 10:45:35,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 0 proven. 2177 refuted. 0 times theorem prover too weak. 11935 trivial. 0 not checked. [2018-11-07 10:45:37,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:37,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 12, 12] total 107 [2018-11-07 10:45:37,204 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:37,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 10:45:37,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 10:45:37,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=10981, Unknown=0, NotChecked=0, Total=11342 [2018-11-07 10:45:37,205 INFO L87 Difference]: Start difference. First operand 349 states and 357 transitions. Second operand 97 states. [2018-11-07 10:45:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:57,507 INFO L93 Difference]: Finished difference Result 418 states and 442 transitions. [2018-11-07 10:45:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-07 10:45:57,507 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 347 [2018-11-07 10:45:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:57,511 INFO L225 Difference]: With dead ends: 418 [2018-11-07 10:45:57,511 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 10:45:57,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 675 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3607 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1459, Invalid=35213, Unknown=0, NotChecked=0, Total=36672 [2018-11-07 10:45:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 10:45:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-07 10:45:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 10:45:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 390 transitions. [2018-11-07 10:45:57,523 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 390 transitions. Word has length 347 [2018-11-07 10:45:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:57,524 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 390 transitions. [2018-11-07 10:45:57,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 10:45:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 390 transitions. [2018-11-07 10:45:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-11-07 10:45:57,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:57,527 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 84, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:57,527 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:57,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 234343471, now seen corresponding path program 21 times [2018-11-07 10:45:57,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:57,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:57,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:57,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:57,528 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 987 proven. 15931 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:46:01,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:01,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:46:01,994 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:46:01,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:46:01,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:01,995 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 10:46:02,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:46:02,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:46:02,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:46:02,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:46:02,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:46:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 2627 proven. 14196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:46:02,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:46:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 2627 proven. 14196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:46:18,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:46:18,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 87, 87] total 178 [2018-11-07 10:46:18,578 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:46:18,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-07 10:46:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-07 10:46:18,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8178, Invalid=23328, Unknown=0, NotChecked=0, Total=31506 [2018-11-07 10:46:18,580 INFO L87 Difference]: Start difference. First operand 381 states and 390 transitions. Second operand 93 states. [2018-11-07 10:46:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:46:33,086 INFO L93 Difference]: Finished difference Result 443 states and 466 transitions. [2018-11-07 10:46:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-11-07 10:46:33,086 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 379 [2018-11-07 10:46:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:46:33,090 INFO L225 Difference]: With dead ends: 443 [2018-11-07 10:46:33,090 INFO L226 Difference]: Without dead ends: 406 [2018-11-07 10:46:33,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 673 SyntacticMatches, 2 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=8178, Invalid=23328, Unknown=0, NotChecked=0, Total=31506 [2018-11-07 10:46:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-07 10:46:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-11-07 10:46:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-07 10:46:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 414 transitions. [2018-11-07 10:46:33,102 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 414 transitions. Word has length 379 [2018-11-07 10:46:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:46:33,103 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 414 transitions. [2018-11-07 10:46:33,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-07 10:46:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 414 transitions. [2018-11-07 10:46:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-11-07 10:46:33,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:46:33,106 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 90, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:46:33,106 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:46:33,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:46:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash -350040161, now seen corresponding path program 22 times [2018-11-07 10:46:33,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:46:33,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:33,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:46:33,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:33,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:46:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 1053 proven. 18145 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:46:38,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:38,226 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:46:38,226 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:46:38,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:46:38,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:38,227 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 10:46:38,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:46:38,240 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:46:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:38,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:46:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 2813 proven. 16290 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 10:46:38,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 10:46:51,129 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 10:46:51,330 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:46:51,330 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:46:51,336 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:46:51,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:46:51 BoogieIcfgContainer [2018-11-07 10:46:51,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:46:51,338 INFO L168 Benchmark]: Toolchain (without parser) took 247370.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 809.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -210.0 MB). Peak memory consumption was 599.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:46:51,339 INFO L168 Benchmark]: CDTParser took 0.22 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 10:46:51,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.00 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 10:46:51,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.42 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 10:46:51,340 INFO L168 Benchmark]: Boogie Preprocessor took 30.14 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 10:46:51,341 INFO L168 Benchmark]: RCFGBuilder took 372.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -756.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:46:51,341 INFO L168 Benchmark]: TraceAbstraction took 246637.87 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 105.9 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 535.6 MB). Peak memory consumption was 641.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:46:51,345 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.22 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. * CACSL2BoogieTranslator took 300.00 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 25.42 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 30.14 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 372.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -756.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246637.87 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 105.9 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 535.6 MB). Peak memory consumption was 641.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was analyzing trace of length 404 with TraceHistMax 99,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 172 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 246.5s OverallTime, 25 OverallIterations, 99 TraceHistogramMax, 104.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1137 SDtfs, 2329 SDslu, 51847 SDs, 0 SdLazy, 144268 SolverSat, 761 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7662 GetRequests, 6018 SyntacticMatches, 37 SemanticMatches, 1607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7497 ImplicationChecksByTransitivity, 105.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 22 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 20.9s SatisfiabilityAnalysisTime, 100.6s InterpolantComputationTime, 6602 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 9819 ConstructedInterpolants, 0 QuantifiedInterpolants, 14239791 SizeOfPredicates, 28 NumberOfNonLiveVariables, 3479 ConjunctsInSsa, 1052 ConjunctsInUnsatCore, 66 InterpolantComputations, 3 PerfectInterpolantSequences, 72550/263636 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown