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.epf -i ../../../trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:58:52,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:58:52,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:58:52,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:58:52,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:58:52,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:58:52,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:58:52,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:58:52,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:58:52,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:58:52,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:58:52,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:58:52,233 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:58:52,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:58:52,236 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:58:52,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:58:52,237 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:58:52,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:58:52,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:58:52,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:58:52,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:58:52,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:58:52,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:58:52,256 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:58:52,257 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:58:52,257 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:58:52,258 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:58:52,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:58:52,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:58:52,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:58:52,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:58:52,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:58:52,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:58:52,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:58:52,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:58:52,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:58:52,265 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:58:52,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:58:52,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:58:52,287 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:58:52,287 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:58:52,287 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:58:52,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:58:52,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:58:52,288 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:58:52,288 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:58:52,288 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:58:52,288 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:58:52,289 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:58:52,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:58:52,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:58:52,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:58:52,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:58:52,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:58:52,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:58:52,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:58:52,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:58:52,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:58:52,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:58:52,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:58:52,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:58:52,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:58:52,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:58:52,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:58:52,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:58:52,295 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:58:52,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:58:52,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:58:52,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:58:52,296 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:58:52,296 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:58:52,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:58:52,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:58:52,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:58:52,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:58:52,385 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:58:52,386 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i [2018-11-07 04:58:52,446 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1122e8ca0/dad2820c330943439abb908f9cd6f0c3/FLAG8dd6cdc5d [2018-11-07 04:58:52,929 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:58:52,930 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i [2018-11-07 04:58:52,946 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1122e8ca0/dad2820c330943439abb908f9cd6f0c3/FLAG8dd6cdc5d [2018-11-07 04:58:52,962 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1122e8ca0/dad2820c330943439abb908f9cd6f0c3 [2018-11-07 04:58:52,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:58:52,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:58:52,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:58:52,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:58:52,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:58:52,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:58:52" (1/1) ... [2018-11-07 04:58:52,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e912aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:52, skipping insertion in model container [2018-11-07 04:58:52,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:58:52" (1/1) ... [2018-11-07 04:58:52,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:58:53,015 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:58:53,206 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:58:53,210 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:58:53,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:58:53,244 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:58:53,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53 WrapperNode [2018-11-07 04:58:53,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:58:53,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:58:53,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:58:53,246 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:58:53,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:58:53,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:58:53,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:58:53,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:58:53,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (1/1) ... [2018-11-07 04:58:53,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:58:53,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:58:53,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:58:53,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:58:53,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (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 04:58:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:58:53,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:58:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:58:53,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:58:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:58:53,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:58:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:58:53,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:58:53,627 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:58:53,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:58:53 BoogieIcfgContainer [2018-11-07 04:58:53,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:58:53,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:58:53,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:58:53,632 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:58:53,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:58:52" (1/3) ... [2018-11-07 04:58:53,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4620c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:58:53, skipping insertion in model container [2018-11-07 04:58:53,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:58:53" (2/3) ... [2018-11-07 04:58:53,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4620c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:58:53, skipping insertion in model container [2018-11-07 04:58:53,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:58:53" (3/3) ... [2018-11-07 04:58:53,635 INFO L112 eAbstractionObserver]: Analyzing ICFG const_false-unreach-call1.i [2018-11-07 04:58:53,646 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:58:53,654 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:58:53,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:58:53,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:58:53,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:58:53,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:58:53,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:58:53,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:58:53,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:58:53,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:58:53,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:58:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 04:58:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 04:58:53,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:53,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:53,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:53,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 04:58:53,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:53,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:53,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:53,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:53,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:53,857 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 04:58:53,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:58:53,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:58:53,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:58:53,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:58:53,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:58:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:58:53,884 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 04:58:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:53,909 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 04:58:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:58:53,910 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 04:58:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:53,918 INFO L225 Difference]: With dead ends: 29 [2018-11-07 04:58:53,919 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 04:58:53,922 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 04:58:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 04:58:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 04:58:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 04:58:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 04:58:53,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 04:58:53,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:53,966 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 04:58:53,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:58:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 04:58:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 04:58:53,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:53,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:53,967 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:53,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 04:58:53,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:53,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:53,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:54,231 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-07 04:58:54,233 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 04:58:54,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:58:54,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:58:54,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:58:54,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:58:54,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:58:54,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:58:54,240 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 04:58:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:54,310 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 04:58:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:58:54,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 04:58:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:54,313 INFO L225 Difference]: With dead ends: 19 [2018-11-07 04:58:54,314 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 04:58:54,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:58:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 04:58:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 04:58:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 04:58:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 04:58:54,323 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 04:58:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:54,324 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 04:58:54,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:58:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 04:58:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:58:54,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:54,325 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:54,326 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:54,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 04:58:54,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:54,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:54,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:54,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:54,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:54,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:54,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:54,456 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 04:58:54,458 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 04:58:54,507 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:58:54,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:58:54,616 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:58:54,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:58:54,837 INFO L272 AbstractInterpreter]: Visited 12 different actions 81 times. Merged at 3 different actions 31 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 04:58:54,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:54,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:58:54,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:54,877 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 04:58:54,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:54,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:54,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:54,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:55,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:55,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 04:58:55,117 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:55,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:58:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:58:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:58:55,118 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 04:58:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:55,147 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 04:58:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:58:55,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 04:58:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:55,151 INFO L225 Difference]: With dead ends: 21 [2018-11-07 04:58:55,151 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 04:58:55,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:58:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 04:58:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 04:58:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 04:58:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 04:58:55,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 04:58:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:55,157 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 04:58:55,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:58:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 04:58:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 04:58:55,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:55,158 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:55,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:55,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 04:58:55,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:55,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:55,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:55,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:55,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:55,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:55,305 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 04:58:55,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:58:55,324 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:55,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:58:55,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:55,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:55,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:56,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:56,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 04:58:56,024 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:56,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:58:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:58:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:58:56,026 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 04:58:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:56,068 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 04:58:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:58:56,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 04:58:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:56,071 INFO L225 Difference]: With dead ends: 23 [2018-11-07 04:58:56,072 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 04:58:56,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:58:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 04:58:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 04:58:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 04:58:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 04:58:56,077 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 04:58:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:56,077 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 04:58:56,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:58:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 04:58:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 04:58:56,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:56,079 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:56,079 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:56,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 04:58:56,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:56,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:56,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:56,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:56,081 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:56,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:56,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:56,208 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:56,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:56,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:56,209 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 04:58:56,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:56,218 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:56,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:56,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:56,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:56,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:57,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:57,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 04:58:57,131 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:57,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:58:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:58:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:58:57,133 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 04:58:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:57,196 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 04:58:57,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:58:57,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 04:58:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:57,198 INFO L225 Difference]: With dead ends: 25 [2018-11-07 04:58:57,198 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 04:58:57,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:58:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 04:58:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 04:58:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 04:58:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 04:58:57,203 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 04:58:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:57,203 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 04:58:57,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:58:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 04:58:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:58:57,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:57,205 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:57,205 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:57,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 04:58:57,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:57,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:57,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:57,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:57,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:57,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:57,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:57,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:57,363 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 04:58:57,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:57,375 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:57,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:57,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 04:58:58,399 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:58:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:58:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:58:58,401 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 04:58:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:58,473 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 04:58:58,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:58:58,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 04:58:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:58,474 INFO L225 Difference]: With dead ends: 27 [2018-11-07 04:58:58,474 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 04:58:58,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:58:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 04:58:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 04:58:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 04:58:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 04:58:58,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 04:58:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:58,481 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 04:58:58,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:58:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 04:58:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 04:58:58,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:58,482 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:58,483 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:58,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:58,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 04:58:58,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:58,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:58,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:58,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:58,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:58,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:58,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:58,621 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:58,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:58,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:58,621 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 04:58:58,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:58:58,631 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:58,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:58:58,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:58,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:58,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:00,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:00,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 04:59:00,730 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:00,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:59:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:59:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:59:00,731 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 04:59:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:00,808 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 04:59:00,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:59:00,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 04:59:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:00,810 INFO L225 Difference]: With dead ends: 29 [2018-11-07 04:59:00,810 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 04:59:00,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:59:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 04:59:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 04:59:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 04:59:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 04:59:00,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 04:59:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:00,816 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 04:59:00,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:59:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 04:59:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 04:59:00,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:00,817 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:00,818 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:00,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 04:59:00,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:00,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:00,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:00,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:01,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:01,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:01,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:01,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:01,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:01,004 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 04:59:01,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:01,015 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:01,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:01,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:01,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:01,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:03,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:03,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 04:59:03,084 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:03,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:59:03,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:59:03,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:59:03,085 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-07 04:59:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:03,161 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 04:59:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:59:03,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 04:59:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:03,163 INFO L225 Difference]: With dead ends: 31 [2018-11-07 04:59:03,163 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 04:59:03,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:59:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 04:59:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 04:59:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 04:59:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-07 04:59:03,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-07 04:59:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:03,169 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-07 04:59:03,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:59:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-07 04:59:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 04:59:03,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:03,170 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:03,171 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:03,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-07 04:59:03,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:03,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:03,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:03,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:03,433 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:03,434 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:03,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:03,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:03,434 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 04:59:03,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:03,449 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:03,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:03,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:07,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:07,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 04:59:07,302 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:07,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 04:59:07,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 04:59:07,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:59:07,303 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-11-07 04:59:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:07,490 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 04:59:07,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:59:07,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-07 04:59:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:07,493 INFO L225 Difference]: With dead ends: 33 [2018-11-07 04:59:07,494 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 04:59:07,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:59:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 04:59:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 04:59:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 04:59:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-07 04:59:07,499 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-07 04:59:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:07,499 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-07 04:59:07,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 04:59:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-07 04:59:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 04:59:07,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:07,500 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:07,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:07,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:07,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-07 04:59:07,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:07,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:07,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:07,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:07,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:07,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:07,728 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:07,729 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:07,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:07,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:07,729 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 04:59:07,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:07,740 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:07,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 04:59:07,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:07,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:07,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:11,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:11,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 04:59:11,570 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:11,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:59:11,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:59:11,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 04:59:11,572 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2018-11-07 04:59:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:11,668 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-07 04:59:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 04:59:11,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-07 04:59:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:11,670 INFO L225 Difference]: With dead ends: 35 [2018-11-07 04:59:11,670 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 04:59:11,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 04:59:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 04:59:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 04:59:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 04:59:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 04:59:11,676 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-07 04:59:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:11,676 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 04:59:11,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:59:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 04:59:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 04:59:11,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:11,677 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:11,678 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:11,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:11,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-07 04:59:11,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:11,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:11,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:11,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:11,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:11,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:11,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:11,860 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:11,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:11,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:11,861 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 04:59:11,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:11,871 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:11,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:11,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:11,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:11,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:16,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:16,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 04:59:16,906 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:16,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 04:59:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 04:59:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 04:59:16,907 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 12 states. [2018-11-07 04:59:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:17,073 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-07 04:59:17,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:59:17,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-07 04:59:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:17,077 INFO L225 Difference]: With dead ends: 37 [2018-11-07 04:59:17,077 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 04:59:17,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 04:59:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 04:59:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 04:59:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 04:59:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-07 04:59:17,082 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-07 04:59:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:17,083 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-07 04:59:17,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 04:59:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-07 04:59:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 04:59:17,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:17,084 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:17,084 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:17,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:17,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-07 04:59:17,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:17,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:17,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:17,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:17,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:17,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:17,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:17,330 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:17,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:17,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:17,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 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 04:59:17,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:17,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:17,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:17,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:23,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:23,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 04:59:23,785 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:23,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 04:59:23,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 04:59:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 04:59:23,787 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-07 04:59:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:23,949 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 04:59:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:59:23,957 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-07 04:59:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:23,958 INFO L225 Difference]: With dead ends: 39 [2018-11-07 04:59:23,958 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 04:59:23,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 04:59:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 04:59:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 04:59:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 04:59:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-07 04:59:23,964 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-07 04:59:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:23,964 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-07 04:59:23,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 04:59:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-07 04:59:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 04:59:23,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:23,966 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:23,967 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:23,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:23,967 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-07 04:59:23,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:23,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:23,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:23,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:23,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:24,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:24,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:24,245 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:24,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:24,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:24,245 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 04:59:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:24,255 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:24,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 04:59:24,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:24,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:24,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:33,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:33,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 04:59:33,558 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:33,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 04:59:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 04:59:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 04:59:33,559 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2018-11-07 04:59:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:34,092 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-07 04:59:34,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 04:59:34,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-07 04:59:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:34,097 INFO L225 Difference]: With dead ends: 41 [2018-11-07 04:59:34,097 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 04:59:34,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 04:59:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 04:59:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 04:59:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 04:59:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 04:59:34,102 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-07 04:59:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:34,103 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 04:59:34,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 04:59:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 04:59:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 04:59:34,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:34,104 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:34,104 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:34,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:34,105 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-07 04:59:34,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:34,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:34,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:34,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:34,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:34,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:34,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:34,363 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 04:59:34,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:34,373 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:34,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:34,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:34,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:34,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:43,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:43,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 04:59:43,999 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:43,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 04:59:44,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 04:59:44,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 04:59:44,000 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-11-07 04:59:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:44,250 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-07 04:59:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 04:59:44,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-07 04:59:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:44,252 INFO L225 Difference]: With dead ends: 43 [2018-11-07 04:59:44,252 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 04:59:44,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 04:59:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 04:59:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 04:59:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 04:59:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-07 04:59:44,257 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-07 04:59:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:44,258 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-07 04:59:44,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 04:59:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-07 04:59:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 04:59:44,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:44,259 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:44,259 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:44,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:44,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 13 times [2018-11-07 04:59:44,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:44,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:44,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:44,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:44,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:44,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:44,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:44,771 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:44,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:44,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:44,771 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 04:59:44,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:44,780 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:44,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:44,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:55,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:55,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 04:59:55,573 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:55,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 04:59:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 04:59:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 04:59:55,574 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-11-07 04:59:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:55,838 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 04:59:55,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 04:59:55,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-07 04:59:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:55,840 INFO L225 Difference]: With dead ends: 45 [2018-11-07 04:59:55,840 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 04:59:55,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 04:59:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 04:59:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-07 04:59:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 04:59:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-07 04:59:55,847 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-07 04:59:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:55,847 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-07 04:59:55,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 04:59:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-07 04:59:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 04:59:55,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:55,848 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:55,848 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:55,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1714997740, now seen corresponding path program 14 times [2018-11-07 04:59:55,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:55,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:56,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:56,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:56,121 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:56,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:56,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:56,121 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 04:59:56,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:56,136 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:56,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 04:59:56,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:56,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:56,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:58,371 WARN L179 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:01,679 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:02,709 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:03,675 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:05,166 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:06,226 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:06,917 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:08,194 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:09,331 WARN L179 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:12,846 WARN L179 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:15,024 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:00:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:16,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:16,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 05:00:16,125 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:16,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:00:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:00:16,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=704, Unknown=2, NotChecked=0, Total=992 [2018-11-07 05:00:16,127 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-11-07 05:00:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:16,310 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-07 05:00:16,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:00:16,316 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-07 05:00:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:16,317 INFO L225 Difference]: With dead ends: 47 [2018-11-07 05:00:16,317 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 05:00:16,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=286, Invalid=704, Unknown=2, NotChecked=0, Total=992 [2018-11-07 05:00:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 05:00:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 05:00:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 05:00:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 05:00:16,324 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-07 05:00:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:16,326 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 05:00:16,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:00:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 05:00:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 05:00:16,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:16,327 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:16,327 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:16,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:16,327 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 15 times [2018-11-07 05:00:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:16,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:16,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:16,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:16,706 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:16,706 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:16,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:16,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:16,706 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 05:00:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:16,716 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:16,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:16,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:16,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:16,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:33,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 05:00:33,158 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:33,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:00:33,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:00:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:00:33,160 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 18 states. [2018-11-07 05:00:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:33,402 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-07 05:00:33,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:00:33,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-07 05:00:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:33,403 INFO L225 Difference]: With dead ends: 49 [2018-11-07 05:00:33,403 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 05:00:33,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:00:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 05:00:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 05:00:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 05:00:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-07 05:00:33,409 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-07 05:00:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:33,411 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-07 05:00:33,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:00:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-07 05:00:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 05:00:33,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:33,412 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:33,413 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:33,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:33,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2083649800, now seen corresponding path program 16 times [2018-11-07 05:00:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:33,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:33,414 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:33,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:33,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:33,769 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:33,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:33,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:33,770 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 05:00:33,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:33,780 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:33,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:33,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:53,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:53,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 05:00:53,612 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:53,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:00:53,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:00:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:00:53,613 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-07 05:00:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:53,931 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 05:00:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:00:53,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-07 05:00:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:53,933 INFO L225 Difference]: With dead ends: 51 [2018-11-07 05:00:53,933 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 05:00:53,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:00:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 05:00:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-07 05:00:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 05:00:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-07 05:00:53,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-07 05:00:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:53,940 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-07 05:00:53,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:00:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-07 05:00:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 05:00:53,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:53,942 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:53,942 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:53,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 17 times [2018-11-07 05:00:53,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:53,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:53,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:53,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:54,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:54,485 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:54,485 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:54,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:54,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:54,485 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 05:00:54,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:54,493 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:56,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 05:00:56,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:56,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:56,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:57,428 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:00,573 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:01,346 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:02,639 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:04,203 WARN L179 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:06,384 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:08,933 WARN L179 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:12,953 WARN L179 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:14,899 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:18,568 WARN L179 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:22,127 WARN L179 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:26,915 WARN L179 SmtUtils]: Spent 892.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:28,698 WARN L179 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:32,198 WARN L179 SmtUtils]: Spent 894.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:01:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 304 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:32,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:32,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 05:01:32,226 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:32,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 05:01:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 05:01:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1004, Unknown=5, NotChecked=0, Total=1406 [2018-11-07 05:01:32,227 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 20 states. [2018-11-07 05:01:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:32,752 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-07 05:01:32,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 05:01:32,752 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-07 05:01:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:32,753 INFO L225 Difference]: With dead ends: 53 [2018-11-07 05:01:32,753 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 05:01:32,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=397, Invalid=1004, Unknown=5, NotChecked=0, Total=1406 [2018-11-07 05:01:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 05:01:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 05:01:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:01:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 05:01:32,759 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-11-07 05:01:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:32,759 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 05:01:32,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 05:01:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 05:01:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 05:01:32,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:32,760 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:32,760 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:32,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash 723901956, now seen corresponding path program 18 times [2018-11-07 05:01:32,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:32,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:32,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:32,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:32,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:34,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:34,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:34,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:34,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:01:34,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:34,164 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 05:01:34,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:01:34,172 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:01:34,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:01:34,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:34,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:34,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:59,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 05:01:59,296 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:59,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 05:01:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 05:01:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 05:01:59,298 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 21 states. [2018-11-07 05:01:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:59,676 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-07 05:01:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 05:01:59,676 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-07 05:01:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:59,677 INFO L225 Difference]: With dead ends: 55 [2018-11-07 05:01:59,677 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 05:01:59,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 05:01:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 05:01:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 05:01:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 05:01:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-07 05:01:59,682 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-11-07 05:01:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:59,683 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-07 05:01:59,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 05:01:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-07 05:01:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 05:01:59,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:59,684 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:59,684 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:59,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash 880063306, now seen corresponding path program 19 times [2018-11-07 05:01:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:59,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:59,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:00,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:00,104 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:00,104 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:00,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:00,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:00,104 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 05:02:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:00,113 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:02:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:00,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:00,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:31,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:31,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 05:02:31,580 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:31,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 05:02:31,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 05:02:31,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:02:31,582 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 22 states. [2018-11-07 05:02:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:31,871 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 05:02:31,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 05:02:31,871 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-07 05:02:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:31,872 INFO L225 Difference]: With dead ends: 57 [2018-11-07 05:02:31,872 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 05:02:31,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:02:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 05:02:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-07 05:02:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 05:02:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-07 05:02:31,878 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-07 05:02:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:31,879 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-07 05:02:31,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 05:02:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-07 05:02:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 05:02:31,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:31,880 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:31,880 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:31,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 627265296, now seen corresponding path program 20 times [2018-11-07 05:02:31,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:31,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:31,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:32,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:32,355 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:32,355 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:32,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:32,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:32,355 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 05:02:32,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:02:32,364 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:02:34,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 05:02:34,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:34,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:34,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:05,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:05,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 05:03:05,210 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:05,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 05:03:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 05:03:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 05:03:05,211 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 23 states. [2018-11-07 05:03:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:05,533 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-07 05:03:05,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 05:03:05,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-11-07 05:03:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:05,537 INFO L225 Difference]: With dead ends: 59 [2018-11-07 05:03:05,537 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 05:03:05,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 05:03:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 05:03:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 05:03:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 05:03:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 05:03:05,542 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-11-07 05:03:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:05,543 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 05:03:05,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 05:03:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 05:03:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 05:03:05,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:05,544 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:05,544 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:05,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1793453738, now seen corresponding path program 21 times [2018-11-07 05:03:05,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,546 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:05,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:05,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:05,997 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:05,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:05,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:05,997 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 05:03:06,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:03:06,006 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:03:06,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:03:06,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:06,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:06,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 05:03:34,261 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 05:03:34,462 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:34,462 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:03:34,467 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:03:34,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:03:34 BoogieIcfgContainer [2018-11-07 05:03:34,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:03:34,468 INFO L168 Benchmark]: Toolchain (without parser) took 281495.23 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.0 MB). Peak memory consumption was 264.8 MB. Max. memory is 7.1 GB. [2018-11-07 05:03:34,469 INFO L168 Benchmark]: CDTParser took 0.24 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 05:03:34,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.79 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 05:03:34,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.65 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 05:03:34,470 INFO L168 Benchmark]: Boogie Preprocessor took 19.98 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 05:03:34,470 INFO L168 Benchmark]: RCFGBuilder took 340.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:03:34,471 INFO L168 Benchmark]: TraceAbstraction took 280839.15 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 316.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -12.5 MB). Peak memory consumption was 304.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:03:34,475 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.24 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 270.79 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 20.65 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 19.98 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 340.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 280839.15 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 316.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -12.5 MB). Peak memory consumption was 304.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 22,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. TIMEOUT Result, 280.7s OverallTime, 23 OverallIterations, 22 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 459 SDtfs, 0 SDslu, 4929 SDs, 0 SdLazy, 3773 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1535 GetRequests, 1051 SyntacticMatches, 23 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 239.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 240.4s InterpolantComputationTime, 1301 NumberOfCodeBlocks, 1301 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 388173 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1760 ConjunctsInSsa, 483 ConjunctsInUnsatCore, 62 InterpolantComputations, 2 PerfectInterpolantSequences, 0/9240 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown