java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:44:29,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:44:29,237 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:44:29,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:44:29,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:44:29,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:44:29,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:44:29,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:44:29,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:44:29,256 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:44:29,257 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:44:29,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:44:29,258 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:44:29,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:44:29,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:44:29,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:44:29,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:44:29,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:44:29,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:44:29,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:44:29,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:44:29,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:44:29,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:44:29,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:44:29,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:44:29,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:44:29,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:44:29,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:44:29,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:44:29,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:44:29,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:44:29,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:44:29,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:44:29,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:44:29,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:44:29,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:44:29,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:44:29,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:44:29,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:44:29,297 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:44:29,297 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:44:29,297 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:44:29,298 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:44:29,298 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:44:29,298 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:44:29,298 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:44:29,298 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:44:29,298 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:44:29,299 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:44:29,299 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:44:29,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:44:29,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:44:29,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:44:29,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:44:29,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:44:29,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:44:29,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:44:29,301 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:44:29,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:44:29,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:44:29,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:44:29,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:44:29,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:44:29,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:44:29,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:44:29,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:44:29,303 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:44:29,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:44:29,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:44:29,303 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:44:29,303 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:44:29,303 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:44:29,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:44:29,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:44:29,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:44:29,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:44:29,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:44:29,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-12 20:44:29,440 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dd2c381/17bda5af35164175a7659f7bd44813ea/FLAGdd6a622c2 [2018-11-12 20:44:29,938 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:44:29,939 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-12 20:44:29,946 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dd2c381/17bda5af35164175a7659f7bd44813ea/FLAGdd6a622c2 [2018-11-12 20:44:29,960 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dd2c381/17bda5af35164175a7659f7bd44813ea [2018-11-12 20:44:29,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:44:29,973 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:44:29,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:29,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:44:29,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:44:29,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:29" (1/1) ... [2018-11-12 20:44:29,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8ac709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:29, skipping insertion in model container [2018-11-12 20:44:29,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:44:29" (1/1) ... [2018-11-12 20:44:29,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:44:30,012 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:44:30,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:30,247 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:44:30,267 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:44:30,285 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:44:30,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30 WrapperNode [2018-11-12 20:44:30,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:44:30,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:30,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:44:30,287 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:44:30,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:44:30,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:44:30,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:44:30,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:44:30,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (1/1) ... [2018-11-12 20:44:30,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:44:30,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:44:30,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:44:30,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:44:30,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (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-12 20:44:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:44:30,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:44:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:44:30,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:44:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:44:30,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:44:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:44:30,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:44:30,665 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:44:30,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:30 BoogieIcfgContainer [2018-11-12 20:44:30,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:44:30,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:44:30,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:44:30,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:44:30,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:44:29" (1/3) ... [2018-11-12 20:44:30,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51029946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:30, skipping insertion in model container [2018-11-12 20:44:30,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:44:30" (2/3) ... [2018-11-12 20:44:30,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51029946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:44:30, skipping insertion in model container [2018-11-12 20:44:30,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:44:30" (3/3) ... [2018-11-12 20:44:30,673 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_false-unreach-call1.c [2018-11-12 20:44:30,681 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:44:30,688 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:44:30,704 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:44:30,736 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:44:30,736 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:44:30,737 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:44:30,737 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:44:30,737 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:44:30,737 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:44:30,737 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:44:30,738 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:44:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-12 20:44:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:44:30,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:30,764 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:30,766 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:30,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-12 20:44:30,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:30,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:30,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:30,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:30,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:30,883 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-12 20:44:30,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:30,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:44:30,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:30,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:44:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:44:30,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:44:30,910 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-12 20:44:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:30,932 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-12 20:44:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:44:30,934 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:44:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:30,943 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:44:30,943 INFO L226 Difference]: Without dead ends: 13 [2018-11-12 20:44:30,947 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-12 20:44:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-12 20:44:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-12 20:44:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-12 20:44:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-12 20:44:30,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-12 20:44:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:30,988 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-12 20:44:30,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:44:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-12 20:44:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:44:30,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:30,989 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:30,989 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:30,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-12 20:44:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:30,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:30,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:31,141 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-12 20:44:31,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:31,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:44:31,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:31,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:44:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:44:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:31,146 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-12 20:44:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:31,234 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-12 20:44:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:31,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:44:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:31,245 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:44:31,245 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:44:31,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:44:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:44:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-12 20:44:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-12 20:44:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-12 20:44:31,252 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-12 20:44:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:31,253 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-12 20:44:31,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:44:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-12 20:44:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:44:31,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:31,254 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:31,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:31,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-12 20:44:31,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:31,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:31,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:31,368 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-12 20:44:31,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:31,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:31,369 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-12 20:44:31,371 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:44:31,407 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:31,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:31,499 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:44:31,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:31,642 INFO L272 AbstractInterpreter]: Visited 13 different actions 69 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Performed 164 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-12 20:44:31,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:31,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:31,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:31,666 INFO L192 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-12 20:44:31,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:31,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:31,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:31,754 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-12 20:44:31,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:32,088 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-12 20:44:32,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:32,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 9 [2018-11-12 20:44:32,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:32,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:44:32,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:44:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:44:32,111 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-12 20:44:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:32,237 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-12 20:44:32,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:44:32,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-12 20:44:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:32,238 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:44:32,239 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:44:32,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:44:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:44:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:44:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:44:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-12 20:44:32,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-12 20:44:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:32,247 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-12 20:44:32,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:44:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-12 20:44:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:44:32,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:32,248 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:32,249 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:32,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-12 20:44:32,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:32,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:32,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:32,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:32,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:32,400 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:32,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:32,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:32,401 INFO L192 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-12 20:44:32,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:32,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:32,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:44:32,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:32,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:44:32,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:44:32,610 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:44:32,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2018-11-12 20:44:32,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:32,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:44:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:44:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:32,612 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-12 20:44:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:32,660 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-12 20:44:32,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:44:32,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-12 20:44:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:32,665 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:44:32,665 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:44:32,666 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:44:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-12 20:44:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:44:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-12 20:44:32,675 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-12 20:44:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:32,675 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-12 20:44:32,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:44:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-12 20:44:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:44:32,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:32,678 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:32,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:32,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1801011421, now seen corresponding path program 1 times [2018-11-12 20:44:32,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:32,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:32,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:32,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:32,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:32,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:32,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:32,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-12 20:44:32,940 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:44:32,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:44:32,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:44:32,946 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:44:33,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:44:33,111 INFO L272 AbstractInterpreter]: Visited 14 different actions 78 times. Merged at 5 different actions 30 times. Widened at 2 different actions 4 times. Performed 224 root evaluator evaluations with a maximum evaluation depth of 4. Performed 224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-12 20:44:33,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:33,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:44:33,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:33,128 INFO L192 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-12 20:44:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:33,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:33,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:33,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:33,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:33,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-12 20:44:33,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:44:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:44:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:33,418 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-12 20:44:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:33,763 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-12 20:44:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:44:33,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:44:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:33,765 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:44:33,765 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:44:33,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:44:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:44:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-12 20:44:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:44:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-12 20:44:33,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-11-12 20:44:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:33,772 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-12 20:44:33,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:44:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-12 20:44:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:44:33,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:33,774 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:33,774 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:33,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:33,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2092450784, now seen corresponding path program 2 times [2018-11-12 20:44:33,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:33,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:33,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:33,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:33,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:33,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:33,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:33,950 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:33,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:33,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:33,950 INFO L192 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-12 20:44:33,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:33,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:33,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:44:33,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:33,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:44:34,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:44:34,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:34,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 8] total 15 [2018-11-12 20:44:34,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:34,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:44:34,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:44:34,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:44:34,358 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-12 20:44:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:34,476 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-12 20:44:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:44:34,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-12 20:44:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:34,479 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:44:34,479 INFO L226 Difference]: Without dead ends: 31 [2018-11-12 20:44:34,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:44:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-12 20:44:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-12 20:44:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-12 20:44:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-12 20:44:34,486 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2018-11-12 20:44:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:34,486 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-12 20:44:34,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:44:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-12 20:44:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:44:34,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:34,488 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:34,488 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:34,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1050905282, now seen corresponding path program 3 times [2018-11-12 20:44:34,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:34,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:34,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:34,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:34,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:34,717 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:34,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:34,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:34,718 INFO L192 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-12 20:44:34,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:34,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:34,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:34,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:34,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:44:34,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:44:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:35,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2018-11-12 20:44:35,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:35,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:44:35,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:44:35,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:44:35,031 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 9 states. [2018-11-12 20:44:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:35,139 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-12 20:44:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:44:35,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-12 20:44:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:35,142 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:44:35,142 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:44:35,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:44:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:44:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-12 20:44:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-12 20:44:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-12 20:44:35,149 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2018-11-12 20:44:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:35,150 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-12 20:44:35,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:44:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-12 20:44:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:44:35,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:35,151 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:35,151 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:35,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash -306121381, now seen corresponding path program 4 times [2018-11-12 20:44:35,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:35,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:35,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:35,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:35,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:35,440 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:35,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:35,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:35,441 INFO L192 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-12 20:44:35,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:35,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:35,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:44:35,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:44:35,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:35,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2018-11-12 20:44:35,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:35,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:44:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:44:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:44:35,930 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2018-11-12 20:44:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:36,119 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-12 20:44:36,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:44:36,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-12 20:44:36,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:36,121 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:44:36,121 INFO L226 Difference]: Without dead ends: 37 [2018-11-12 20:44:36,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:44:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-12 20:44:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-12 20:44:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-12 20:44:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-12 20:44:36,127 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2018-11-12 20:44:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:36,128 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-12 20:44:36,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:44:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-12 20:44:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:44:36,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:36,129 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:36,129 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:36,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:36,130 INFO L82 PathProgramCache]: Analyzing trace with hash -249977826, now seen corresponding path program 5 times [2018-11-12 20:44:36,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:36,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:36,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:36,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:36,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:36,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:36,303 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:36,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:36,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:36,303 INFO L192 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-12 20:44:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:36,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:36,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:44:36,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:36,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:44:36,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:44:37,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:37,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 9] total 21 [2018-11-12 20:44:37,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:37,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:44:37,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:44:37,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:44:37,190 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 14 states. [2018-11-12 20:44:45,659 WARN L179 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-12 20:44:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:45,781 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-12 20:44:45,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:44:45,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-12 20:44:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:45,783 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:44:45,783 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:44:45,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=127, Invalid=378, Unknown=1, NotChecked=0, Total=506 [2018-11-12 20:44:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:44:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-12 20:44:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-12 20:44:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-12 20:44:45,791 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 35 [2018-11-12 20:44:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:45,791 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-12 20:44:45,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:44:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-12 20:44:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:44:45,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:45,793 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:45,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:45,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash 607533056, now seen corresponding path program 6 times [2018-11-12 20:44:45,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:45,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:45,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:46,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:46,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:46,102 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:46,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:46,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:46,102 INFO L192 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-12 20:44:46,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:46,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:46,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:46,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:46,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:46,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:46,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:46,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2018-11-12 20:44:46,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:46,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:44:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:44:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:44:46,848 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 13 states. [2018-11-12 20:44:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:47,102 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-12 20:44:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:44:47,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-12 20:44:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:47,105 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:44:47,105 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:44:47,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:44:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:44:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-12 20:44:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-12 20:44:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-12 20:44:47,113 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 41 [2018-11-12 20:44:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:47,113 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-12 20:44:47,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:44:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-12 20:44:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:44:47,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:47,115 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:47,115 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:47,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1655862429, now seen corresponding path program 7 times [2018-11-12 20:44:47,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:47,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:47,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:47,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:47,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:47,339 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:47,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:47,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:47,340 INFO L192 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-12 20:44:47,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:47,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:47,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:44:47,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:44:48,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:48,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2018-11-12 20:44:48,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:48,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:44:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:44:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:44:48,296 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-11-12 20:44:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:48,582 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-12 20:44:48,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:44:48,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-12 20:44:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:48,584 INFO L225 Difference]: With dead ends: 66 [2018-11-12 20:44:48,584 INFO L226 Difference]: Without dead ends: 49 [2018-11-12 20:44:48,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:44:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-12 20:44:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-12 20:44:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-12 20:44:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-12 20:44:48,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2018-11-12 20:44:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:48,591 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-12 20:44:48,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:44:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-12 20:44:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:44:48,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:48,592 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:48,592 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:48,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash -565963040, now seen corresponding path program 8 times [2018-11-12 20:44:48,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:48,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:48,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:48,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:48,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:48,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:48,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:48,860 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:48,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:48,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:48,860 INFO L192 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-12 20:44:48,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:48,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:48,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:44:48,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:48,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:44:49,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:44:49,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:49,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 10] total 27 [2018-11-12 20:44:49,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:49,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:44:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:44:49,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:44:49,526 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 19 states. [2018-11-12 20:44:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:50,721 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-12 20:44:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:44:50,721 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-12 20:44:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:50,722 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:44:50,723 INFO L226 Difference]: Without dead ends: 58 [2018-11-12 20:44:50,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:44:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-12 20:44:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-11-12 20:44:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-12 20:44:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-12 20:44:50,730 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 47 [2018-11-12 20:44:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:50,730 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-12 20:44:50,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:44:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-12 20:44:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:44:50,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:50,731 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:50,731 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:50,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash -829748866, now seen corresponding path program 9 times [2018-11-12 20:44:50,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:50,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:50,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:51,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:51,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:51,183 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:51,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:51,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:51,183 INFO L192 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-12 20:44:51,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:44:51,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:44:51,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:44:51,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:51,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:44:51,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:44:52,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:52,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 29 [2018-11-12 20:44:52,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:52,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:44:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:44:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:44:52,141 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 17 states. [2018-11-12 20:44:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:52,438 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-11-12 20:44:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:44:52,442 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-12 20:44:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:52,443 INFO L225 Difference]: With dead ends: 81 [2018-11-12 20:44:52,443 INFO L226 Difference]: Without dead ends: 61 [2018-11-12 20:44:52,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:44:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-12 20:44:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-12 20:44:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-12 20:44:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-12 20:44:52,459 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 53 [2018-11-12 20:44:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:52,459 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-12 20:44:52,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:44:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-12 20:44:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:44:52,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:52,461 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:52,461 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:52,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 794925150, now seen corresponding path program 10 times [2018-11-12 20:44:52,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:52,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:53,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:53,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:53,171 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:53,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:53,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:53,171 INFO L192 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-12 20:44:53,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:53,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:53,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:44:53,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:44:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 33 [2018-11-12 20:44:54,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:54,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:44:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:44:54,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:44:54,220 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2018-11-12 20:44:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:54,589 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-12 20:44:54,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:44:54,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-12 20:44:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:54,591 INFO L225 Difference]: With dead ends: 87 [2018-11-12 20:44:54,591 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:44:54,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:44:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:44:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-12 20:44:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-12 20:44:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-12 20:44:54,599 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 59 [2018-11-12 20:44:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:54,599 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-12 20:44:54,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:44:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-12 20:44:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-12 20:44:54,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:54,601 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:54,601 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:54,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 369721150, now seen corresponding path program 11 times [2018-11-12 20:44:54,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:54,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:54,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:54,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:55,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:55,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:55,014 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:55,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:55,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:55,015 INFO L192 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-12 20:44:55,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:55,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:55,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:44:55,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:55,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-12 20:44:55,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-12 20:44:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 11] total 35 [2018-11-12 20:44:56,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:56,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:44:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:44:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:44:56,347 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 26 states. [2018-11-12 20:44:57,771 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:45:04,670 WARN L179 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:45:13,065 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:45:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:17,954 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-11-12 20:45:17,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:45:17,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-12 20:45:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:17,955 INFO L225 Difference]: With dead ends: 108 [2018-11-12 20:45:17,955 INFO L226 Difference]: Without dead ends: 88 [2018-11-12 20:45:17,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=454, Invalid=1350, Unknown=2, NotChecked=0, Total=1806 [2018-11-12 20:45:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-12 20:45:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2018-11-12 20:45:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:45:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-12 20:45:17,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 65 [2018-11-12 20:45:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:17,969 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-12 20:45:17,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:45:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-12 20:45:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-12 20:45:17,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:17,971 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:17,971 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:17,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash 10718589, now seen corresponding path program 12 times [2018-11-12 20:45:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:17,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:17,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:18,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:18,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:18,408 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:18,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:18,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:18,408 INFO L192 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-12 20:45:18,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:18,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:18,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:18,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:18,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:45:18,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:45:20,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 45 [2018-11-12 20:45:20,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:20,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:45:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:45:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:45:20,293 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 24 states. [2018-11-12 20:45:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:21,052 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-12 20:45:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:45:21,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-12 20:45:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:21,054 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:45:21,054 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:45:21,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:45:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:45:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-12 20:45:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-12 20:45:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-11-12 20:45:21,063 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2018-11-12 20:45:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:21,063 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-11-12 20:45:21,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:45:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-12 20:45:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-12 20:45:21,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:21,065 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:21,065 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:21,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1880758400, now seen corresponding path program 13 times [2018-11-12 20:45:21,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:21,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:21,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:21,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:21,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:21,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:21,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:21,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:21,523 INFO L192 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-12 20:45:21,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:21,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:45:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:21,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:45:21,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:45:23,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:23,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 44 [2018-11-12 20:45:23,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:23,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:45:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:45:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:45:23,665 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 25 states. [2018-11-12 20:45:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:24,263 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-12 20:45:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:45:24,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-12 20:45:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:24,265 INFO L225 Difference]: With dead ends: 105 [2018-11-12 20:45:24,265 INFO L226 Difference]: Without dead ends: 82 [2018-11-12 20:45:24,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:45:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-12 20:45:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-12 20:45:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-12 20:45:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-12 20:45:24,275 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 77 [2018-11-12 20:45:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:24,276 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-12 20:45:24,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:45:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-12 20:45:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-12 20:45:24,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:24,277 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:24,277 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:24,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2078995811, now seen corresponding path program 14 times [2018-11-12 20:45:24,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:24,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:24,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:45:24,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:24,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:25,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:25,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:25,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:25,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:25,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:25,199 INFO L192 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-12 20:45:25,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:45:25,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:45:25,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:45:25,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:25,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-12 20:45:25,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-12 20:45:25,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:25,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 11] total 41 [2018-11-12 20:45:25,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:25,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:45:25,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:45:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:45:25,931 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 32 states. [2018-11-12 20:45:27,307 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:45:35,594 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:45:40,453 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:45:43,809 WARN L179 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-12 20:45:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:55,833 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-12 20:45:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:45:55,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-11-12 20:45:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:55,834 INFO L225 Difference]: With dead ends: 117 [2018-11-12 20:45:55,834 INFO L226 Difference]: Without dead ends: 94 [2018-11-12 20:45:55,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=533, Invalid=1626, Unknown=3, NotChecked=0, Total=2162 [2018-11-12 20:45:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-12 20:45:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2018-11-12 20:45:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:45:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-12 20:45:55,844 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 80 [2018-11-12 20:45:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:55,844 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-12 20:45:55,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:45:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-12 20:45:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:45:55,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:55,845 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:55,846 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:55,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash 59221243, now seen corresponding path program 15 times [2018-11-12 20:45:55,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:55,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:55,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:45:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:45:56,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:56,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:45:56,854 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:45:56,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:45:56,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:45:56,854 INFO L192 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-12 20:45:56,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:45:56,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:45:56,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:45:56,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:45:56,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:45:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:45:56,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:45:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:45:59,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:45:59,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 23] total 49 [2018-11-12 20:45:59,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:45:59,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:45:59,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:45:59,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:45:59,057 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 28 states. [2018-11-12 20:45:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:45:59,826 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-12 20:45:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:45:59,826 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-12 20:45:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:45:59,827 INFO L225 Difference]: With dead ends: 118 [2018-11-12 20:45:59,828 INFO L226 Difference]: Without dead ends: 93 [2018-11-12 20:45:59,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:45:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-12 20:45:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-12 20:45:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-12 20:45:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-11-12 20:45:59,837 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 86 [2018-11-12 20:45:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:45:59,837 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-11-12 20:45:59,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:45:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-12 20:45:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-12 20:45:59,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:45:59,838 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:45:59,839 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:45:59,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:45:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1341754853, now seen corresponding path program 16 times [2018-11-12 20:45:59,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:45:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:59,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:45:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:45:59,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:45:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:01,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:01,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:01,377 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:01,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:01,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:01,377 INFO L192 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-12 20:46:01,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:01,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:46:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:01,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:46:01,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:46:04,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:04,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 25] total 53 [2018-11-12 20:46:04,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:04,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:46:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:46:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:46:04,802 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 30 states. [2018-11-12 20:46:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:46:05,661 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-12 20:46:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:46:05,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-12 20:46:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:46:05,663 INFO L225 Difference]: With dead ends: 124 [2018-11-12 20:46:05,663 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:46:05,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:46:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:46:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-12 20:46:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:46:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-11-12 20:46:05,670 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 92 [2018-11-12 20:46:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:46:05,670 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-11-12 20:46:05,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:46:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-12 20:46:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-12 20:46:05,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:46:05,671 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:46:05,672 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:46:05,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:46:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2143361221, now seen corresponding path program 17 times [2018-11-12 20:46:05,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:46:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:05,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:46:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:46:05,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:46:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:46:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:46:06,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:06,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:46:06,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:46:06,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:46:06,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:46:06,344 INFO L192 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-12 20:46:06,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:46:06,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:46:06,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:46:06,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:46:06,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:46:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-12 20:46:06,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:46:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-12 20:46:07,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:46:07,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 12] total 49 [2018-11-12 20:46:07,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:46:07,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:46:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:46:07,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:46:07,332 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 39 states. [2018-11-12 20:46:15,332 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-12 20:46:22,141 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:46:36,654 WARN L179 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:47:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:00,325 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-11-12 20:47:00,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:47:00,326 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 98 [2018-11-12 20:47:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:00,328 INFO L225 Difference]: With dead ends: 137 [2018-11-12 20:47:00,328 INFO L226 Difference]: Without dead ends: 112 [2018-11-12 20:47:00,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=766, Invalid=2309, Unknown=5, NotChecked=0, Total=3080 [2018-11-12 20:47:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-12 20:47:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-11-12 20:47:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-12 20:47:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-11-12 20:47:00,338 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 98 [2018-11-12 20:47:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:00,339 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-11-12 20:47:00,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:47:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-11-12 20:47:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-12 20:47:00,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:00,340 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:00,340 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:00,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:00,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1159676448, now seen corresponding path program 18 times [2018-11-12 20:47:00,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:00,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:00,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:00,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:00,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 155 proven. 1395 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:47:01,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:01,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:01,101 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:01,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:01,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:01,102 INFO L192 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-12 20:47:01,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:47:01,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:47:01,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:47:01,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:01,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:47:01,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:47:03,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:03,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28, 29] total 61 [2018-11-12 20:47:03,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:03,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:47:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:47:03,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:47:03,926 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 34 states. [2018-11-12 20:47:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:05,165 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-12 20:47:05,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:47:05,169 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 107 [2018-11-12 20:47:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:05,170 INFO L225 Difference]: With dead ends: 142 [2018-11-12 20:47:05,170 INFO L226 Difference]: Without dead ends: 114 [2018-11-12 20:47:05,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:47:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-12 20:47:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-12 20:47:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-12 20:47:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-11-12 20:47:05,181 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 107 [2018-11-12 20:47:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:05,182 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-11-12 20:47:05,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:47:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-12 20:47:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 20:47:05,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:05,183 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 27, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:05,183 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:05,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash -628496128, now seen corresponding path program 19 times [2018-11-12 20:47:05,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:05,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:47:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:05,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 165 proven. 1584 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:47:05,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:05,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:05,981 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:05,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:05,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:05,982 INFO L192 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-12 20:47:05,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:05,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:47:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:06,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1134 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:47:06,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 560 proven. 1131 refuted. 3 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:47:11,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:11,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30, 31] total 65 [2018-11-12 20:47:11,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:11,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:47:11,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:47:11,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=3012, Unknown=1, NotChecked=0, Total=4160 [2018-11-12 20:47:11,774 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 36 states. [2018-11-12 20:47:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:47:13,009 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-11-12 20:47:13,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:47:13,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 113 [2018-11-12 20:47:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:47:13,010 INFO L225 Difference]: With dead ends: 148 [2018-11-12 20:47:13,010 INFO L226 Difference]: Without dead ends: 120 [2018-11-12 20:47:13,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1147, Invalid=3012, Unknown=1, NotChecked=0, Total=4160 [2018-11-12 20:47:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-12 20:47:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-12 20:47:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-12 20:47:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2018-11-12 20:47:13,021 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 113 [2018-11-12 20:47:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:47:13,022 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2018-11-12 20:47:13,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:47:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2018-11-12 20:47:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:47:13,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:47:13,023 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 29, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:47:13,023 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:47:13,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:47:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -866916384, now seen corresponding path program 20 times [2018-11-12 20:47:13,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:47:13,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:13,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:47:13,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:47:13,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:47:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:47:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 175 proven. 1785 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:47:14,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:14,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:47:14,407 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:47:14,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:47:14,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:47:14,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:47:14,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:47:14,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:47:14,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:47:14,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:47:14,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:47:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 667 proven. 77 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-12 20:47:14,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:47:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 667 proven. 77 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2018-11-12 20:47:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:47:15,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 10, 13] total 57 [2018-11-12 20:47:15,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:47:15,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:47:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:47:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2477, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:47:15,621 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand 46 states. [2018-11-12 20:47:24,400 WARN L179 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2018-11-12 20:47:33,684 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:47:49,520 WARN L179 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-12 20:48:03,665 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-12 20:48:08,602 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:48:13,640 WARN L179 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:48:21,518 WARN L179 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:48:38,603 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:48:49,981 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2018-11-12 20:49:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:49:00,241 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2018-11-12 20:49:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:49:00,241 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 119 [2018-11-12 20:49:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:49:00,242 INFO L225 Difference]: With dead ends: 171 [2018-11-12 20:49:00,242 INFO L226 Difference]: Without dead ends: 143 [2018-11-12 20:49:00,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 86.6s TimeCoverageRelationStatistics Valid=1153, Invalid=3399, Unknown=8, NotChecked=132, Total=4692 [2018-11-12 20:49:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-12 20:49:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2018-11-12 20:49:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-12 20:49:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-11-12 20:49:00,254 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 119 [2018-11-12 20:49:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:49:00,255 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-11-12 20:49:00,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:49:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-12 20:49:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-12 20:49:00,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:49:00,256 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 31, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:49:00,256 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:49:00,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:49:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1688030821, now seen corresponding path program 21 times [2018-11-12 20:49:00,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:49:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:49:00,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:49:00,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:49:00,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:49:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:49:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 296 proven. 1998 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:49:01,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:49:01,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:49:01,669 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:49:01,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:49:01,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:49:01,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:49:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:49:01,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:49:01,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:49:01,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:49:01,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:49:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 736 proven. 1488 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:49:01,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:49:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 736 proven. 1488 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-12 20:49:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:49:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 34, 35] total 73 [2018-11-12 20:49:06,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:49:06,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:49:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:49:06,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=3821, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:49:06,099 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 40 states. Received shutdown request... [2018-11-12 20:49:06,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:49:06,656 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:49:06,662 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:49:06,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:49:06 BoogieIcfgContainer [2018-11-12 20:49:06,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:49:06,663 INFO L168 Benchmark]: Toolchain (without parser) took 276691.66 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 900.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -856.6 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2018-11-12 20:49:06,664 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:49:06,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.84 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-12 20:49:06,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.34 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-12 20:49:06,665 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 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-12 20:49:06,666 INFO L168 Benchmark]: RCFGBuilder took 327.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:49:06,666 INFO L168 Benchmark]: TraceAbstraction took 275995.75 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 155.2 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -64.7 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2018-11-12 20:49:06,670 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 312.84 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 24.34 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 26.55 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 327.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275995.75 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 155.2 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -64.7 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and FLOYD_HOARE automaton (currently 14 states, 40 states before enhancement),while ReachableStatesComputation was computing reachable states (38 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 275.9s OverallTime, 25 OverallIterations, 40 TraceHistogramMax, 227.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 587 SDtfs, 493 SDslu, 9047 SDs, 0 SdLazy, 15094 SolverSat, 699 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 59.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3432 GetRequests, 2573 SyntacticMatches, 60 SemanticMatches, 799 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 207.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 45.8s InterpolantComputationTime, 2927 NumberOfCodeBlocks, 2675 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 4309 ConstructedInterpolants, 0 QuantifiedInterpolants, 2249069 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2109 ConjunctsInSsa, 629 ConjunctsInUnsatCore, 71 InterpolantComputations, 4 PerfectInterpolantSequences, 17684/45447 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown