java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/n.c24_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:52:48,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:52:48,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:52:48,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:52:48,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:52:48,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:52:48,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:52:48,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:52:48,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:52:48,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:52:48,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:52:48,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:52:48,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:52:48,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:52:48,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:52:48,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:52:48,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:52:48,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:52:48,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:52:48,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:52:48,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:52:48,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:52:48,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:52:48,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:52:48,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:52:48,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:52:48,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:52:48,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:52:48,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:52:48,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:52:48,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:52:48,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:52:48,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:52:48,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:52:48,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:52:48,440 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:52:48,440 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:52:48,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:52:48,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:52:48,465 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:52:48,465 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:52:48,465 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:52:48,466 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:52:48,466 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:52:48,466 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:52:48,466 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:52:48,467 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:52:48,467 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:52:48,467 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:52:48,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:52:48,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:52:48,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:52:48,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:52:48,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:52:48,470 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:52:48,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:52:48,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:52:48,470 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:52:48,470 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:52:48,471 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:52:48,471 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:52:48,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:52:48,471 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:52:48,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:52:48,472 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:52:48,472 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:52:48,472 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:52:48,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:52:48,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:52:48,473 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:52:48,473 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:52:48,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:52:48,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:52:48,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:52:48,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:52:48,557 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:52:48,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c24_false-unreach-call.i [2018-11-07 04:52:48,631 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abad2274f/a7a6efef6ceb404cbcee011c403ceff1/FLAGafe2179bc [2018-11-07 04:52:49,180 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:52:49,181 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c24_false-unreach-call.i [2018-11-07 04:52:49,191 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abad2274f/a7a6efef6ceb404cbcee011c403ceff1/FLAGafe2179bc [2018-11-07 04:52:49,207 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abad2274f/a7a6efef6ceb404cbcee011c403ceff1 [2018-11-07 04:52:49,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:52:49,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:52:49,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:52:49,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:52:49,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:52:49,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc89e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49, skipping insertion in model container [2018-11-07 04:52:49,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:52:49,274 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:52:49,609 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:52:49,626 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:52:49,675 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:52:49,724 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:52:49,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49 WrapperNode [2018-11-07 04:52:49,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:52:49,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:52:49,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:52:49,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:52:49,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:52:49,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:52:49,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:52:49,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:52:49,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... [2018-11-07 04:52:49,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:52:49,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:52:49,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:52:49,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:52:49,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:52:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:52:49,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:52:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2018-11-07 04:52:49,999 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2018-11-07 04:52:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:52:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:52:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:52:49,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:52:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:52:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-07 04:52:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-07 04:52:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:52:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-07 04:52:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-07 04:52:50,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:52:50,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:52:50,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:52:50,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:52:50,648 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:52:50,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:50 BoogieIcfgContainer [2018-11-07 04:52:50,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:52:50,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:52:50,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:52:50,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:52:50,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:52:49" (1/3) ... [2018-11-07 04:52:50,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d50c12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:50, skipping insertion in model container [2018-11-07 04:52:50,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:49" (2/3) ... [2018-11-07 04:52:50,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d50c12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:50, skipping insertion in model container [2018-11-07 04:52:50,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:50" (3/3) ... [2018-11-07 04:52:50,657 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c24_false-unreach-call.i [2018-11-07 04:52:50,667 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:52:50,675 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:52:50,692 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:52:50,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:52:50,729 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:52:50,729 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:52:50,729 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:52:50,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:52:50,731 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:52:50,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:52:50,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:52:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-11-07 04:52:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 04:52:50,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:50,761 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:50,763 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:50,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash 450221827, now seen corresponding path program 1 times [2018-11-07 04:52:50,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:50,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:50,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:50,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:50,818 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:50,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:50,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:52:50,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:50,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:52:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:52:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:52:50,930 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-11-07 04:52:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:50,962 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2018-11-07 04:52:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:52:50,965 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-07 04:52:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:50,977 INFO L225 Difference]: With dead ends: 155 [2018-11-07 04:52:50,977 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 04:52:50,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:52:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 04:52:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-07 04:52:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 04:52:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-07 04:52:51,040 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 17 [2018-11-07 04:52:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:51,041 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-07 04:52:51,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:52:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-07 04:52:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:52:51,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:51,043 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:51,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:51,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:51,044 INFO L82 PathProgramCache]: Analyzing trace with hash -14559774, now seen corresponding path program 1 times [2018-11-07 04:52:51,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:51,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:51,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:51,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:51,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:51,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:52:51,148 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:51,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:52:51,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:52:51,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:52:51,151 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 3 states. [2018-11-07 04:52:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:51,319 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-11-07 04:52:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:52:51,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-07 04:52:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:51,323 INFO L225 Difference]: With dead ends: 141 [2018-11-07 04:52:51,323 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 04:52:51,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:52:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 04:52:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2018-11-07 04:52:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 04:52:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-07 04:52:51,350 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 19 [2018-11-07 04:52:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:51,352 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-07 04:52:51,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:52:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-07 04:52:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 04:52:51,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:51,354 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:51,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:51,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash -432499953, now seen corresponding path program 1 times [2018-11-07 04:52:51,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:51,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:51,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:52:51,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:51,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:51,518 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 04:52:51,519 INFO L202 CegarAbsIntRunner]: [2], [3], [21], [22], [23], [24], [25], [29], [32], [34], [35], [36], [38], [42], [46], [49], [51], [59], [67], [71], [74], [139], [150], [153], [155], [161], [162], [163], [171] [2018-11-07 04:52:51,572 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:51,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:52,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:52,320 INFO L272 AbstractInterpreter]: Visited 29 different actions 120 times. Merged at 13 different actions 75 times. Widened at 3 different actions 7 times. Found 2 fixpoints after 2 different actions. Largest state had 25 variables. [2018-11-07 04:52:52,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:52,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:52,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:52,334 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:52,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:52,343 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:52,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:52:52,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:52:52,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:52,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 04:52:52,582 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:52,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:52:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:52:52,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:52:52,585 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 5 states. [2018-11-07 04:52:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:52,900 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2018-11-07 04:52:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:52:52,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-07 04:52:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:52,903 INFO L225 Difference]: With dead ends: 175 [2018-11-07 04:52:52,903 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 04:52:52,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:52:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 04:52:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2018-11-07 04:52:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-07 04:52:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-11-07 04:52:52,923 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 31 [2018-11-07 04:52:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:52,923 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-11-07 04:52:52,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:52:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-11-07 04:52:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 04:52:52,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:52,926 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:52,926 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:52,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1524754498, now seen corresponding path program 2 times [2018-11-07 04:52:52,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:52,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:52,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:52,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:52,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 04:52:53,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:53,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:53,035 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:53,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:53,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:53,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:53,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:52:53,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:52:53,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 04:52:53,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:53,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 04:52:53,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 04:52:53,263 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:52:53,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-07 04:52:53,264 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:53,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:52:53,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:52:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-07 04:52:53,265 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 5 states. [2018-11-07 04:52:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:53,446 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2018-11-07 04:52:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:52:53,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-07 04:52:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:53,449 INFO L225 Difference]: With dead ends: 155 [2018-11-07 04:52:53,449 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 04:52:53,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:52:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 04:52:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 100. [2018-11-07 04:52:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 04:52:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2018-11-07 04:52:53,480 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 43 [2018-11-07 04:52:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:53,481 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2018-11-07 04:52:53,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:52:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2018-11-07 04:52:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 04:52:53,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:53,490 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:53,490 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:53,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash -179494359, now seen corresponding path program 1 times [2018-11-07 04:52:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:53,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:52:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:53,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 04:52:53,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:53,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:53,672 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-07 04:52:53,672 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [5], [6], [7], [8], [9], [21], [22], [23], [24], [25], [29], [32], [34], [35], [36], [38], [42], [46], [49], [51], [59], [67], [71], [74], [76], [78], [86], [89], [135], [139], [150], [153], [155], [161], [162], [163], [165], [166], [171] [2018-11-07 04:52:53,675 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:53,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:54,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:54,709 INFO L272 AbstractInterpreter]: Visited 42 different actions 387 times. Merged at 19 different actions 193 times. Widened at 5 different actions 25 times. Found 20 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-07 04:52:54,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:54,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:54,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:54,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:54,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:54,761 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:54,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 04:52:54,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 04:52:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 04:52:54,935 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:54,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:52:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:52:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:52:54,936 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 6 states. [2018-11-07 04:52:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:55,347 INFO L93 Difference]: Finished difference Result 249 states and 312 transitions. [2018-11-07 04:52:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:52:55,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-07 04:52:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:55,350 INFO L225 Difference]: With dead ends: 249 [2018-11-07 04:52:55,350 INFO L226 Difference]: Without dead ends: 171 [2018-11-07 04:52:55,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:52:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-07 04:52:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2018-11-07 04:52:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-07 04:52:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2018-11-07 04:52:55,365 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 57 [2018-11-07 04:52:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:55,365 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2018-11-07 04:52:55,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:52:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-07 04:52:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 04:52:55,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:55,368 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:55,368 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:55,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 989080022, now seen corresponding path program 2 times [2018-11-07 04:52:55,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:55,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:55,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-07 04:52:55,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:55,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:55,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:55,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:55,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:55,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:52:55,498 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:52:55,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:52:55,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:55,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:52:55,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 04:52:55,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:55,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2018-11-07 04:52:55,938 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:55,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:52:55,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:52:55,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:52:55,939 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand 11 states. [2018-11-07 04:52:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:57,028 INFO L93 Difference]: Finished difference Result 556 states and 738 transitions. [2018-11-07 04:52:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 04:52:57,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-07 04:52:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:57,033 INFO L225 Difference]: With dead ends: 556 [2018-11-07 04:52:57,033 INFO L226 Difference]: Without dead ends: 448 [2018-11-07 04:52:57,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2018-11-07 04:52:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-07 04:52:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 186. [2018-11-07 04:52:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-07 04:52:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2018-11-07 04:52:57,063 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 69 [2018-11-07 04:52:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:57,063 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2018-11-07 04:52:57,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:52:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2018-11-07 04:52:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 04:52:57,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:57,067 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:57,067 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:57,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1387648560, now seen corresponding path program 3 times [2018-11-07 04:52:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:57,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:52:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:57,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 04:52:57,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:57,224 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:57,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:57,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:57,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:57,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:57,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:52:57,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:52:57,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:52:57,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:57,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 04:52:57,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 04:52:57,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:57,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 04:52:57,638 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:57,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:52:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:52:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:52:57,639 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand 8 states. [2018-11-07 04:52:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:57,856 INFO L93 Difference]: Finished difference Result 455 states and 598 transitions. [2018-11-07 04:52:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:52:57,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-11-07 04:52:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:57,859 INFO L225 Difference]: With dead ends: 455 [2018-11-07 04:52:57,859 INFO L226 Difference]: Without dead ends: 301 [2018-11-07 04:52:57,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:52:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-07 04:52:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 218. [2018-11-07 04:52:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-07 04:52:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2018-11-07 04:52:57,881 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 95 [2018-11-07 04:52:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:57,882 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2018-11-07 04:52:57,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:52:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2018-11-07 04:52:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 04:52:57,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:57,885 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:57,886 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:57,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1410045859, now seen corresponding path program 4 times [2018-11-07 04:52:57,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:57,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:52:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:57,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 04:52:58,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:58,007 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:58,007 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:58,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:58,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:58,008 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:58,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:58,020 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:58,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 04:52:58,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 04:52:58,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:58,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 04:52:58,495 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:58,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:52:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:52:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:52:58,496 INFO L87 Difference]: Start difference. First operand 218 states and 278 transitions. Second operand 9 states. [2018-11-07 04:52:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:58,777 INFO L93 Difference]: Finished difference Result 514 states and 677 transitions. [2018-11-07 04:52:58,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:52:58,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2018-11-07 04:52:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:58,781 INFO L225 Difference]: With dead ends: 514 [2018-11-07 04:52:58,781 INFO L226 Difference]: Without dead ends: 333 [2018-11-07 04:52:58,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:52:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-07 04:52:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 250. [2018-11-07 04:52:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-07 04:52:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 320 transitions. [2018-11-07 04:52:58,804 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 320 transitions. Word has length 107 [2018-11-07 04:52:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:58,804 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 320 transitions. [2018-11-07 04:52:58,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:52:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2018-11-07 04:52:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 04:52:58,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:58,807 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:58,808 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1773521040, now seen corresponding path program 5 times [2018-11-07 04:52:58,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:58,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-07 04:52:58,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:58,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:58,966 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:58,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:58,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:58,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:58,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:52:58,975 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:52:59,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 04:52:59,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:59,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-07 04:52:59,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-07 04:52:59,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:59,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2018-11-07 04:52:59,585 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:59,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 04:52:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 04:52:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:52:59,589 INFO L87 Difference]: Start difference. First operand 250 states and 320 transitions. Second operand 15 states. [2018-11-07 04:53:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:02,007 INFO L93 Difference]: Finished difference Result 1119 states and 1511 transitions. [2018-11-07 04:53:02,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 04:53:02,008 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 119 [2018-11-07 04:53:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:02,015 INFO L225 Difference]: With dead ends: 1119 [2018-11-07 04:53:02,015 INFO L226 Difference]: Without dead ends: 908 [2018-11-07 04:53:02,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 04:53:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-11-07 04:53:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 304. [2018-11-07 04:53:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-07 04:53:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 394 transitions. [2018-11-07 04:53:02,054 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 394 transitions. Word has length 119 [2018-11-07 04:53:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:02,055 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 394 transitions. [2018-11-07 04:53:02,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 04:53:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 394 transitions. [2018-11-07 04:53:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 04:53:02,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:02,058 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:02,058 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:02,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:02,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1227931300, now seen corresponding path program 6 times [2018-11-07 04:53:02,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:02,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:02,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:02,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:02,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-07 04:53:02,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:02,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:02,348 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:02,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:02,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:02,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:02,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:53:02,359 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:53:02,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:53:02,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:02,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-07 04:53:02,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-07 04:53:02,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:02,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 04:53:02,711 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:02,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:53:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:53:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:53:02,713 INFO L87 Difference]: Start difference. First operand 304 states and 394 transitions. Second operand 11 states. [2018-11-07 04:53:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:03,545 INFO L93 Difference]: Finished difference Result 720 states and 963 transitions. [2018-11-07 04:53:03,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:53:03,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2018-11-07 04:53:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:03,549 INFO L225 Difference]: With dead ends: 720 [2018-11-07 04:53:03,549 INFO L226 Difference]: Without dead ends: 463 [2018-11-07 04:53:03,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:53:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-07 04:53:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 336. [2018-11-07 04:53:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-07 04:53:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 436 transitions. [2018-11-07 04:53:03,584 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 436 transitions. Word has length 145 [2018-11-07 04:53:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:03,584 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 436 transitions. [2018-11-07 04:53:03,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:53:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 436 transitions. [2018-11-07 04:53:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 04:53:03,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:03,589 INFO L375 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:03,589 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:03,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1845445719, now seen corresponding path program 7 times [2018-11-07 04:53:03,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:03,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:03,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:03,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-07 04:53:04,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:04,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:04,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:04,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:04,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:04,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:04,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:04,012 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:53:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:04,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-07 04:53:04,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-07 04:53:04,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:04,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 04:53:04,420 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:04,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 04:53:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 04:53:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:53:04,421 INFO L87 Difference]: Start difference. First operand 336 states and 436 transitions. Second operand 12 states. [2018-11-07 04:53:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:05,361 INFO L93 Difference]: Finished difference Result 779 states and 1042 transitions. [2018-11-07 04:53:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 04:53:05,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2018-11-07 04:53:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:05,366 INFO L225 Difference]: With dead ends: 779 [2018-11-07 04:53:05,366 INFO L226 Difference]: Without dead ends: 495 [2018-11-07 04:53:05,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:53:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-11-07 04:53:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 368. [2018-11-07 04:53:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-07 04:53:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 478 transitions. [2018-11-07 04:53:05,399 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 478 transitions. Word has length 157 [2018-11-07 04:53:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:05,400 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 478 transitions. [2018-11-07 04:53:05,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 04:53:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 478 transitions. [2018-11-07 04:53:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 04:53:05,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:05,403 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:05,403 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:05,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1305145788, now seen corresponding path program 8 times [2018-11-07 04:53:05,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:05,405 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-07 04:53:05,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:05,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:05,608 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:05,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:05,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:05,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:05,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:53:05,619 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:53:05,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 04:53:05,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:05,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-11-07 04:53:05,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-11-07 04:53:06,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:06,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2018-11-07 04:53:06,022 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:06,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 04:53:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 04:53:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-11-07 04:53:06,024 INFO L87 Difference]: Start difference. First operand 368 states and 478 transitions. Second operand 19 states. [2018-11-07 04:53:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:09,872 INFO L93 Difference]: Finished difference Result 1838 states and 2500 transitions. [2018-11-07 04:53:09,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-07 04:53:09,873 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 169 [2018-11-07 04:53:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:09,881 INFO L225 Difference]: With dead ends: 1838 [2018-11-07 04:53:09,881 INFO L226 Difference]: Without dead ends: 1524 [2018-11-07 04:53:09,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1773, Invalid=4547, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 04:53:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-11-07 04:53:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 422. [2018-11-07 04:53:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-07 04:53:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 552 transitions. [2018-11-07 04:53:09,940 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 552 transitions. Word has length 169 [2018-11-07 04:53:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:09,940 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 552 transitions. [2018-11-07 04:53:09,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 04:53:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 552 transitions. [2018-11-07 04:53:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-07 04:53:09,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:09,944 INFO L375 BasicCegarLoop]: trace histogram [14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:09,944 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:09,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 876152798, now seen corresponding path program 9 times [2018-11-07 04:53:09,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:09,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:09,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-11-07 04:53:10,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:10,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:10,171 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:10,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:10,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:10,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:53:10,190 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:53:10,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:53:10,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:10,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-11-07 04:53:10,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-11-07 04:53:10,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:10,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 04:53:10,524 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:10,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 04:53:10,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 04:53:10,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:53:10,525 INFO L87 Difference]: Start difference. First operand 422 states and 552 transitions. Second operand 14 states. [2018-11-07 04:53:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:10,832 INFO L93 Difference]: Finished difference Result 985 states and 1328 transitions. [2018-11-07 04:53:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:53:10,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2018-11-07 04:53:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:10,835 INFO L225 Difference]: With dead ends: 985 [2018-11-07 04:53:10,835 INFO L226 Difference]: Without dead ends: 625 [2018-11-07 04:53:10,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:53:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-07 04:53:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 454. [2018-11-07 04:53:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-11-07 04:53:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 594 transitions. [2018-11-07 04:53:10,888 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 594 transitions. Word has length 195 [2018-11-07 04:53:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:10,888 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 594 transitions. [2018-11-07 04:53:10,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 04:53:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 594 transitions. [2018-11-07 04:53:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 04:53:10,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:10,891 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:10,891 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:10,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:10,892 INFO L82 PathProgramCache]: Analyzing trace with hash 72907851, now seen corresponding path program 10 times [2018-11-07 04:53:10,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:10,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:10,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:10,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-07 04:53:11,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:11,652 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:11,652 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:11,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:11,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:11,652 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:11,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:11,661 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:53:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:11,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-07 04:53:11,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-07 04:53:12,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:12,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 04:53:12,076 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:12,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 04:53:12,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 04:53:12,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 04:53:12,077 INFO L87 Difference]: Start difference. First operand 454 states and 594 transitions. Second operand 15 states. [2018-11-07 04:53:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:12,816 INFO L93 Difference]: Finished difference Result 1044 states and 1407 transitions. [2018-11-07 04:53:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 04:53:12,816 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2018-11-07 04:53:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:12,820 INFO L225 Difference]: With dead ends: 1044 [2018-11-07 04:53:12,820 INFO L226 Difference]: Without dead ends: 657 [2018-11-07 04:53:12,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 04:53:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-07 04:53:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 486. [2018-11-07 04:53:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-07 04:53:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 636 transitions. [2018-11-07 04:53:12,877 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 636 transitions. Word has length 207 [2018-11-07 04:53:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:12,877 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 636 transitions. [2018-11-07 04:53:12,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 04:53:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 636 transitions. [2018-11-07 04:53:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 04:53:12,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:12,880 INFO L375 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:12,880 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:12,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:12,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1743680062, now seen corresponding path program 11 times [2018-11-07 04:53:12,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:12,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:12,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-11-07 04:53:14,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:14,057 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:14,057 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:14,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:14,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:14,057 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:14,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:53:14,066 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:53:14,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:53:14,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:14,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 145 proven. 50 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-11-07 04:53:14,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 145 proven. 50 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-11-07 04:53:14,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:14,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2018-11-07 04:53:14,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:14,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 04:53:14,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 04:53:14,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:53:14,688 INFO L87 Difference]: Start difference. First operand 486 states and 636 transitions. Second operand 23 states. [2018-11-07 04:53:15,917 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-07 04:53:17,883 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-07 04:53:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:20,113 INFO L93 Difference]: Finished difference Result 2713 states and 3705 transitions. [2018-11-07 04:53:20,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-11-07 04:53:20,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 219 [2018-11-07 04:53:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:20,122 INFO L225 Difference]: With dead ends: 2713 [2018-11-07 04:53:20,122 INFO L226 Difference]: Without dead ends: 2296 [2018-11-07 04:53:20,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3948 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3647, Invalid=9235, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 04:53:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2018-11-07 04:53:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 540. [2018-11-07 04:53:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-07 04:53:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 710 transitions. [2018-11-07 04:53:20,219 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 710 transitions. Word has length 219 [2018-11-07 04:53:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:20,219 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 710 transitions. [2018-11-07 04:53:20,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 04:53:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 710 transitions. [2018-11-07 04:53:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-07 04:53:20,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:20,223 INFO L375 BasicCegarLoop]: trace histogram [18, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:20,223 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:20,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash -361569774, now seen corresponding path program 12 times [2018-11-07 04:53:20,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:20,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:20,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:20,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:20,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-07 04:53:21,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:21,067 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:21,067 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:21,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:21,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:21,068 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:21,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:53:21,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:53:21,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:53:21,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:21,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-07 04:53:21,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-07 04:53:21,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:21,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 04:53:21,572 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:21,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 04:53:21,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 04:53:21,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:53:21,573 INFO L87 Difference]: Start difference. First operand 540 states and 710 transitions. Second operand 17 states. [2018-11-07 04:53:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:21,970 INFO L93 Difference]: Finished difference Result 1250 states and 1693 transitions. [2018-11-07 04:53:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 04:53:21,970 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 245 [2018-11-07 04:53:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:21,975 INFO L225 Difference]: With dead ends: 1250 [2018-11-07 04:53:21,975 INFO L226 Difference]: Without dead ends: 787 [2018-11-07 04:53:21,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:53:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-07 04:53:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 572. [2018-11-07 04:53:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-11-07 04:53:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 752 transitions. [2018-11-07 04:53:22,057 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 752 transitions. Word has length 245 [2018-11-07 04:53:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:22,060 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 752 transitions. [2018-11-07 04:53:22,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 04:53:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 752 transitions. [2018-11-07 04:53:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-07 04:53:22,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:22,064 INFO L375 BasicCegarLoop]: trace histogram [19, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:22,064 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:22,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:22,064 INFO L82 PathProgramCache]: Analyzing trace with hash -651174523, now seen corresponding path program 13 times [2018-11-07 04:53:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:22,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:22,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-11-07 04:53:22,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:22,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:22,747 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:22,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:22,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:22,757 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:53:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:22,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-11-07 04:53:22,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-11-07 04:53:23,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:23,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 04:53:23,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:23,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 04:53:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 04:53:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 04:53:23,271 INFO L87 Difference]: Start difference. First operand 572 states and 752 transitions. Second operand 18 states. [2018-11-07 04:53:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:23,822 INFO L93 Difference]: Finished difference Result 1309 states and 1772 transitions. [2018-11-07 04:53:23,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 04:53:23,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 257 [2018-11-07 04:53:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:23,833 INFO L225 Difference]: With dead ends: 1309 [2018-11-07 04:53:23,833 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 04:53:23,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 04:53:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 04:53:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 604. [2018-11-07 04:53:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-07 04:53:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 794 transitions. [2018-11-07 04:53:23,930 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 794 transitions. Word has length 257 [2018-11-07 04:53:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:23,930 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 794 transitions. [2018-11-07 04:53:23,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 04:53:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 794 transitions. [2018-11-07 04:53:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 04:53:23,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:23,934 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:23,934 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:23,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1489484210, now seen corresponding path program 14 times [2018-11-07 04:53:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:23,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:23,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:23,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:23,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2018-11-07 04:53:24,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:24,470 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:24,470 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:24,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:24,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:24,470 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:24,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:53:24,479 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:53:24,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 04:53:24,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:24,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 140 proven. 152 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-11-07 04:53:25,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 212 proven. 80 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-11-07 04:53:25,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:25,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 11] total 38 [2018-11-07 04:53:25,357 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:25,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 04:53:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 04:53:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 04:53:25,358 INFO L87 Difference]: Start difference. First operand 604 states and 794 transitions. Second operand 29 states. [2018-11-07 04:53:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:35,424 INFO L93 Difference]: Finished difference Result 3744 states and 5126 transitions. [2018-11-07 04:53:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-11-07 04:53:35,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 269 [2018-11-07 04:53:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:35,440 INFO L225 Difference]: With dead ends: 3744 [2018-11-07 04:53:35,440 INFO L226 Difference]: Without dead ends: 3224 [2018-11-07 04:53:35,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10358 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8266, Invalid=21490, Unknown=0, NotChecked=0, Total=29756 [2018-11-07 04:53:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2018-11-07 04:53:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 658. [2018-11-07 04:53:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-07 04:53:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 868 transitions. [2018-11-07 04:53:35,590 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 868 transitions. Word has length 269 [2018-11-07 04:53:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:35,590 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 868 transitions. [2018-11-07 04:53:35,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 04:53:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 868 transitions. [2018-11-07 04:53:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-07 04:53:35,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:35,594 INFO L375 BasicCegarLoop]: trace histogram [22, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:35,594 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:35,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash 570716300, now seen corresponding path program 15 times [2018-11-07 04:53:35,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:35,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:35,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:35,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-07 04:53:35,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:35,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:35,962 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:35,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:35,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:35,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:35,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:53:35,970 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:53:36,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:53:36,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:36,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-07 04:53:36,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-07 04:53:36,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:36,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 04:53:36,565 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:36,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 04:53:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 04:53:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:53:36,566 INFO L87 Difference]: Start difference. First operand 658 states and 868 transitions. Second operand 20 states. [2018-11-07 04:53:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:37,330 INFO L93 Difference]: Finished difference Result 1515 states and 2058 transitions. [2018-11-07 04:53:37,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 04:53:37,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 295 [2018-11-07 04:53:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:37,335 INFO L225 Difference]: With dead ends: 1515 [2018-11-07 04:53:37,336 INFO L226 Difference]: Without dead ends: 949 [2018-11-07 04:53:37,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:53:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-11-07 04:53:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 690. [2018-11-07 04:53:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-11-07 04:53:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 910 transitions. [2018-11-07 04:53:37,489 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 910 transitions. Word has length 295 [2018-11-07 04:53:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:37,489 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 910 transitions. [2018-11-07 04:53:37,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 04:53:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 910 transitions. [2018-11-07 04:53:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-07 04:53:37,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:37,493 INFO L375 BasicCegarLoop]: trace histogram [23, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:37,494 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:37,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:37,494 INFO L82 PathProgramCache]: Analyzing trace with hash 448796473, now seen corresponding path program 16 times [2018-11-07 04:53:37,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:37,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:37,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-07 04:53:37,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:37,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:37,992 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:37,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:37,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:37,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:38,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:38,003 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:53:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:38,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-07 04:53:38,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-07 04:53:40,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:40,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 04:53:40,202 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:40,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 04:53:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 04:53:40,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 04:53:40,207 INFO L87 Difference]: Start difference. First operand 690 states and 910 transitions. Second operand 21 states. [2018-11-07 04:53:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:41,020 INFO L93 Difference]: Finished difference Result 1574 states and 2137 transitions. [2018-11-07 04:53:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 04:53:41,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 307 [2018-11-07 04:53:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:41,026 INFO L225 Difference]: With dead ends: 1574 [2018-11-07 04:53:41,026 INFO L226 Difference]: Without dead ends: 981 [2018-11-07 04:53:41,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 04:53:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-11-07 04:53:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 722. [2018-11-07 04:53:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-11-07 04:53:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 952 transitions. [2018-11-07 04:53:41,173 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 952 transitions. Word has length 307 [2018-11-07 04:53:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:41,173 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 952 transitions. [2018-11-07 04:53:41,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 04:53:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 952 transitions. [2018-11-07 04:53:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-07 04:53:41,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:41,178 INFO L375 BasicCegarLoop]: trace histogram [24, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:41,178 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:41,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1205162732, now seen corresponding path program 17 times [2018-11-07 04:53:41,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:41,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:41,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2018-11-07 04:53:41,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:41,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:41,933 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:41,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:41,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:41,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:41,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:53:41,942 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:53:42,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 04:53:42,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:42,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 291 proven. 117 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2018-11-07 04:53:42,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2334 backedges. 291 proven. 117 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2018-11-07 04:53:43,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:43,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 41 [2018-11-07 04:53:43,050 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:43,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 04:53:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 04:53:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1294, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 04:53:43,051 INFO L87 Difference]: Start difference. First operand 722 states and 952 transitions. Second operand 31 states. [2018-11-07 04:53:49,528 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-07 04:53:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:55,675 INFO L93 Difference]: Finished difference Result 4931 states and 6763 transitions. [2018-11-07 04:53:55,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-11-07 04:53:55,675 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 319 [2018-11-07 04:53:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:55,691 INFO L225 Difference]: With dead ends: 4931 [2018-11-07 04:53:55,691 INFO L226 Difference]: Without dead ends: 4308 [2018-11-07 04:53:55,695 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14847 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11259, Invalid=28541, Unknown=0, NotChecked=0, Total=39800 [2018-11-07 04:53:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2018-11-07 04:53:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 776. [2018-11-07 04:53:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-07 04:53:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1026 transitions. [2018-11-07 04:53:55,866 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1026 transitions. Word has length 319 [2018-11-07 04:53:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:55,867 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1026 transitions. [2018-11-07 04:53:55,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 04:53:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1026 transitions. [2018-11-07 04:53:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-07 04:53:55,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:55,871 INFO L375 BasicCegarLoop]: trace histogram [26, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:55,871 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:55,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:55,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1129991296, now seen corresponding path program 18 times [2018-11-07 04:53:55,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:55,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:55,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-11-07 04:53:56,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:56,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:56,790 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:56,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:56,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:56,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:56,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:53:56,799 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:53:56,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:53:56,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:56,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-11-07 04:53:57,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2018-11-07 04:53:57,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:57,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 04:53:57,606 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:57,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 04:53:57,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 04:53:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:53:57,608 INFO L87 Difference]: Start difference. First operand 776 states and 1026 transitions. Second operand 23 states. [2018-11-07 04:53:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:58,528 INFO L93 Difference]: Finished difference Result 1780 states and 2423 transitions. [2018-11-07 04:53:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 04:53:58,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 345 [2018-11-07 04:53:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:58,536 INFO L225 Difference]: With dead ends: 1780 [2018-11-07 04:53:58,536 INFO L226 Difference]: Without dead ends: 1111 [2018-11-07 04:53:58,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:53:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2018-11-07 04:53:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 808. [2018-11-07 04:53:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-07 04:53:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1068 transitions. [2018-11-07 04:53:58,708 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1068 transitions. Word has length 345 [2018-11-07 04:53:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:58,708 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1068 transitions. [2018-11-07 04:53:58,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 04:53:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1068 transitions. [2018-11-07 04:53:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-11-07 04:53:58,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:58,713 INFO L375 BasicCegarLoop]: trace histogram [27, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:58,713 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:58,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1908960691, now seen corresponding path program 19 times [2018-11-07 04:53:58,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:58,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:58,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:58,715 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2018-11-07 04:53:59,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:59,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:59,189 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:59,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:59,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:59,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:59,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:59,197 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:53:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:59,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2018-11-07 04:53:59,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2018-11-07 04:54:00,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:00,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 04:54:00,455 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:00,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 04:54:00,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 04:54:00,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 04:54:00,457 INFO L87 Difference]: Start difference. First operand 808 states and 1068 transitions. Second operand 24 states. [2018-11-07 04:54:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:01,274 INFO L93 Difference]: Finished difference Result 1839 states and 2502 transitions. [2018-11-07 04:54:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 04:54:01,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 357 [2018-11-07 04:54:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:01,280 INFO L225 Difference]: With dead ends: 1839 [2018-11-07 04:54:01,280 INFO L226 Difference]: Without dead ends: 1143 [2018-11-07 04:54:01,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 04:54:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-11-07 04:54:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 840. [2018-11-07 04:54:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-07 04:54:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1110 transitions. [2018-11-07 04:54:01,442 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1110 transitions. Word has length 357 [2018-11-07 04:54:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:01,442 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1110 transitions. [2018-11-07 04:54:01,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 04:54:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1110 transitions. [2018-11-07 04:54:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-11-07 04:54:01,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:01,446 INFO L375 BasicCegarLoop]: trace histogram [28, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:01,447 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:01,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1197059104, now seen corresponding path program 20 times [2018-11-07 04:54:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:01,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:01,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 2100 trivial. 0 not checked. [2018-11-07 04:54:02,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:02,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:02,113 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:02,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:02,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:02,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:02,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:54:02,124 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:54:02,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 04:54:02,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:02,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 382 proven. 161 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-07 04:54:02,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 382 proven. 161 refuted. 0 times theorem prover too weak. 2649 trivial. 0 not checked. [2018-11-07 04:54:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:03,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 13] total 46 [2018-11-07 04:54:03,165 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:03,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 04:54:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 04:54:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 04:54:03,166 INFO L87 Difference]: Start difference. First operand 840 states and 1110 transitions. Second operand 35 states. [2018-11-07 04:54:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:20,441 INFO L93 Difference]: Finished difference Result 6274 states and 8616 transitions. [2018-11-07 04:54:20,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-11-07 04:54:20,442 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 369 [2018-11-07 04:54:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:20,467 INFO L225 Difference]: With dead ends: 6274 [2018-11-07 04:54:20,467 INFO L226 Difference]: Without dead ends: 5548 [2018-11-07 04:54:20,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25447 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17825, Invalid=45427, Unknown=0, NotChecked=0, Total=63252 [2018-11-07 04:54:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-11-07 04:54:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 894. [2018-11-07 04:54:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-07 04:54:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1184 transitions. [2018-11-07 04:54:20,811 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1184 transitions. Word has length 369 [2018-11-07 04:54:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:20,812 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1184 transitions. [2018-11-07 04:54:20,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 04:54:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1184 transitions. [2018-11-07 04:54:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 04:54:20,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:20,817 INFO L375 BasicCegarLoop]: trace histogram [30, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:20,817 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:20,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash -69103558, now seen corresponding path program 21 times [2018-11-07 04:54:20,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:20,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:20,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:20,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2018-11-07 04:54:21,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:21,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:21,326 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:21,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:21,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:21,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:54:21,336 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:54:21,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:54:21,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:21,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2018-11-07 04:54:21,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 2405 trivial. 0 not checked. [2018-11-07 04:54:22,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 04:54:22,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:22,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 04:54:22,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 04:54:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 04:54:22,265 INFO L87 Difference]: Start difference. First operand 894 states and 1184 transitions. Second operand 26 states. [2018-11-07 04:54:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:23,151 INFO L93 Difference]: Finished difference Result 2045 states and 2788 transitions. [2018-11-07 04:54:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 04:54:23,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 395 [2018-11-07 04:54:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:23,158 INFO L225 Difference]: With dead ends: 2045 [2018-11-07 04:54:23,158 INFO L226 Difference]: Without dead ends: 1273 [2018-11-07 04:54:23,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 04:54:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2018-11-07 04:54:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 926. [2018-11-07 04:54:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-11-07 04:54:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1226 transitions. [2018-11-07 04:54:23,399 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1226 transitions. Word has length 395 [2018-11-07 04:54:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:23,400 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1226 transitions. [2018-11-07 04:54:23,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 04:54:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1226 transitions. [2018-11-07 04:54:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-11-07 04:54:23,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:23,403 INFO L375 BasicCegarLoop]: trace histogram [31, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:23,403 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:23,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash 515422503, now seen corresponding path program 22 times [2018-11-07 04:54:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:23,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:23,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 2577 trivial. 0 not checked. [2018-11-07 04:54:24,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:24,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:24,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:24,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:24,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:24,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:24,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:24,665 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:54:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:24,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 2577 trivial. 0 not checked. [2018-11-07 04:54:24,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 2577 trivial. 0 not checked. [2018-11-07 04:54:26,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:26,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 04:54:26,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:26,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 04:54:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 04:54:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 04:54:26,295 INFO L87 Difference]: Start difference. First operand 926 states and 1226 transitions. Second operand 27 states. [2018-11-07 04:54:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:27,380 INFO L93 Difference]: Finished difference Result 2104 states and 2867 transitions. [2018-11-07 04:54:27,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 04:54:27,381 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 407 [2018-11-07 04:54:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:27,387 INFO L225 Difference]: With dead ends: 2104 [2018-11-07 04:54:27,387 INFO L226 Difference]: Without dead ends: 1305 [2018-11-07 04:54:27,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 04:54:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2018-11-07 04:54:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 958. [2018-11-07 04:54:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-07 04:54:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1268 transitions. [2018-11-07 04:54:27,760 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1268 transitions. Word has length 407 [2018-11-07 04:54:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:27,760 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1268 transitions. [2018-11-07 04:54:27,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 04:54:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1268 transitions. [2018-11-07 04:54:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-07 04:54:27,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:27,766 INFO L375 BasicCegarLoop]: trace histogram [32, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:27,766 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:27,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:27,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2068583782, now seen corresponding path program 23 times [2018-11-07 04:54:27,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:27,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:27,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:27,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:27,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2018-11-07 04:54:28,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:28,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:28,982 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:28,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:28,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:28,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:28,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:54:28,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:54:29,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 04:54:29,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:29,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 485 proven. 212 refuted. 0 times theorem prover too weak. 3487 trivial. 0 not checked. [2018-11-07 04:54:29,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:30,795 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 04:54:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 485 proven. 212 refuted. 0 times theorem prover too weak. 3487 trivial. 0 not checked. [2018-11-07 04:54:31,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:31,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 14] total 51 [2018-11-07 04:54:31,611 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:31,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 04:54:31,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 04:54:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=1993, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 04:54:31,613 INFO L87 Difference]: Start difference. First operand 958 states and 1268 transitions. Second operand 39 states. [2018-11-07 04:54:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:55,929 INFO L93 Difference]: Finished difference Result 7773 states and 10685 transitions. [2018-11-07 04:54:55,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 288 states. [2018-11-07 04:54:55,930 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 419 [2018-11-07 04:54:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:55,945 INFO L225 Difference]: With dead ends: 7773 [2018-11-07 04:54:55,945 INFO L226 Difference]: Without dead ends: 6944 [2018-11-07 04:54:55,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1357 GetRequests, 1048 SyntacticMatches, 1 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41179 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=26873, Invalid=68917, Unknown=0, NotChecked=0, Total=95790 [2018-11-07 04:54:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6944 states. [2018-11-07 04:54:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6944 to 1012. [2018-11-07 04:54:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-11-07 04:54:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1342 transitions. [2018-11-07 04:54:56,326 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1342 transitions. Word has length 419 [2018-11-07 04:54:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:56,326 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1342 transitions. [2018-11-07 04:54:56,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 04:54:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1342 transitions. [2018-11-07 04:54:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-11-07 04:54:56,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:56,330 INFO L375 BasicCegarLoop]: trace histogram [34, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:56,330 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:56,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1381268974, now seen corresponding path program 24 times [2018-11-07 04:54:56,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:56,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-11-07 04:54:56,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:56,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:56,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:56,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:56,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:56,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:54:56,994 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:54:57,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:54:57,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:57,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-11-07 04:54:57,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-11-07 04:54:58,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:58,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 04:54:58,197 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:58,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 04:54:58,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 04:54:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 04:54:58,199 INFO L87 Difference]: Start difference. First operand 1012 states and 1342 transitions. Second operand 29 states. [2018-11-07 04:54:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:59,579 INFO L93 Difference]: Finished difference Result 2310 states and 3153 transitions. [2018-11-07 04:54:59,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 04:54:59,580 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 445 [2018-11-07 04:54:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:59,584 INFO L225 Difference]: With dead ends: 2310 [2018-11-07 04:54:59,584 INFO L226 Difference]: Without dead ends: 1435 [2018-11-07 04:54:59,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 864 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 04:54:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2018-11-07 04:55:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1044. [2018-11-07 04:55:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2018-11-07 04:55:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1384 transitions. [2018-11-07 04:55:00,050 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1384 transitions. Word has length 445 [2018-11-07 04:55:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:00,050 INFO L480 AbstractCegarLoop]: Abstraction has 1044 states and 1384 transitions. [2018-11-07 04:55:00,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 04:55:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1384 transitions. [2018-11-07 04:55:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-11-07 04:55:00,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:00,056 INFO L375 BasicCegarLoop]: trace histogram [35, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:00,057 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:00,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash -806193951, now seen corresponding path program 25 times [2018-11-07 04:55:00,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:00,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:00,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:00,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:00,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 3299 trivial. 0 not checked. [2018-11-07 04:55:02,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:02,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:02,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:02,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:02,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:02,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:02,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:02,055 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:02,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 3299 trivial. 0 not checked. [2018-11-07 04:55:02,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 3299 trivial. 0 not checked. [2018-11-07 04:55:03,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:03,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 04:55:03,361 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:03,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 04:55:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 04:55:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 04:55:03,362 INFO L87 Difference]: Start difference. First operand 1044 states and 1384 transitions. Second operand 30 states. [2018-11-07 04:55:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:04,587 INFO L93 Difference]: Finished difference Result 2369 states and 3232 transitions. [2018-11-07 04:55:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 04:55:04,588 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 457 [2018-11-07 04:55:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:04,591 INFO L225 Difference]: With dead ends: 2369 [2018-11-07 04:55:04,592 INFO L226 Difference]: Without dead ends: 1467 [2018-11-07 04:55:04,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 887 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 04:55:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-07 04:55:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1076. [2018-11-07 04:55:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-07 04:55:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1426 transitions. [2018-11-07 04:55:05,007 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1426 transitions. Word has length 457 [2018-11-07 04:55:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:05,007 INFO L480 AbstractCegarLoop]: Abstraction has 1076 states and 1426 transitions. [2018-11-07 04:55:05,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 04:55:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1426 transitions. [2018-11-07 04:55:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-11-07 04:55:05,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:05,012 INFO L375 BasicCegarLoop]: trace histogram [36, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:05,012 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:05,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1893229966, now seen corresponding path program 26 times [2018-11-07 04:55:05,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:05,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:05,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:05,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:05,014 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2018-11-07 04:55:06,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:06,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:06,247 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:06,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:06,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:06,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:06,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:06,258 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:06,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 04:55:06,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:06,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 600 proven. 270 refuted. 0 times theorem prover too weak. 4440 trivial. 0 not checked. [2018-11-07 04:55:07,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 600 proven. 270 refuted. 0 times theorem prover too weak. 4440 trivial. 0 not checked. [2018-11-07 04:55:08,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:08,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 15, 15] total 56 [2018-11-07 04:55:08,810 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:08,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 04:55:08,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 04:55:08,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=2398, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 04:55:08,811 INFO L87 Difference]: Start difference. First operand 1076 states and 1426 transitions. Second operand 43 states. [2018-11-07 04:55:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:43,340 INFO L93 Difference]: Finished difference Result 9428 states and 12970 transitions. [2018-11-07 04:55:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 350 states. [2018-11-07 04:55:43,341 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 469 [2018-11-07 04:55:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:43,358 INFO L225 Difference]: With dead ends: 9428 [2018-11-07 04:55:43,359 INFO L226 Difference]: Without dead ends: 8496 [2018-11-07 04:55:43,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1575 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62775 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=38952, Invalid=100550, Unknown=0, NotChecked=0, Total=139502 [2018-11-07 04:55:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2018-11-07 04:55:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 1130. [2018-11-07 04:55:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-07 04:55:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1500 transitions. [2018-11-07 04:55:43,852 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1500 transitions. Word has length 469 [2018-11-07 04:55:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:43,852 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1500 transitions. [2018-11-07 04:55:43,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 04:55:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1500 transitions. [2018-11-07 04:55:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-11-07 04:55:43,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:43,856 INFO L375 BasicCegarLoop]: trace histogram [38, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:43,856 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:43,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash 786032360, now seen corresponding path program 27 times [2018-11-07 04:55:43,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:43,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:43,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5838 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 3892 trivial. 0 not checked. [2018-11-07 04:55:45,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:45,177 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:45,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:45,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:45,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:45,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:45,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:55:45,186 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:55:45,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:55:45,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:45,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5838 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 3892 trivial. 0 not checked. [2018-11-07 04:55:45,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5838 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 3892 trivial. 0 not checked. [2018-11-07 04:55:46,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:46,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 04:55:46,889 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:46,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 04:55:46,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 04:55:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:55:46,890 INFO L87 Difference]: Start difference. First operand 1130 states and 1500 transitions. Second operand 32 states. [2018-11-07 04:55:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:48,562 INFO L93 Difference]: Finished difference Result 2575 states and 3518 transitions. [2018-11-07 04:55:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 04:55:48,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 495 [2018-11-07 04:55:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:48,566 INFO L225 Difference]: With dead ends: 2575 [2018-11-07 04:55:48,566 INFO L226 Difference]: Without dead ends: 1597 [2018-11-07 04:55:48,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:55:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2018-11-07 04:55:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1162. [2018-11-07 04:55:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2018-11-07 04:55:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1542 transitions. [2018-11-07 04:55:48,931 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1542 transitions. Word has length 495 [2018-11-07 04:55:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:48,932 INFO L480 AbstractCegarLoop]: Abstraction has 1162 states and 1542 transitions. [2018-11-07 04:55:48,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 04:55:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1542 transitions. [2018-11-07 04:55:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-11-07 04:55:48,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:48,936 INFO L375 BasicCegarLoop]: trace histogram [39, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:48,936 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:48,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash -904928747, now seen corresponding path program 28 times [2018-11-07 04:55:48,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:48,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:48,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6198 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 4110 trivial. 0 not checked. [2018-11-07 04:55:49,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:49,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:49,820 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:49,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:49,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:49,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:49,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:49,829 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:49,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6198 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 4110 trivial. 0 not checked. [2018-11-07 04:55:50,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6198 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 4110 trivial. 0 not checked. [2018-11-07 04:55:51,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:51,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 04:55:51,260 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:51,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 04:55:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 04:55:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 04:55:51,262 INFO L87 Difference]: Start difference. First operand 1162 states and 1542 transitions. Second operand 33 states. [2018-11-07 04:55:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:53,175 INFO L93 Difference]: Finished difference Result 2634 states and 3597 transitions. [2018-11-07 04:55:53,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 04:55:53,175 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 507 [2018-11-07 04:55:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:53,177 INFO L225 Difference]: With dead ends: 2634 [2018-11-07 04:55:53,177 INFO L226 Difference]: Without dead ends: 1629 [2018-11-07 04:55:53,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 984 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 04:55:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-11-07 04:55:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1194. [2018-11-07 04:55:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2018-11-07 04:55:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1584 transitions. [2018-11-07 04:55:53,582 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1584 transitions. Word has length 507 [2018-11-07 04:55:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:53,583 INFO L480 AbstractCegarLoop]: Abstraction has 1194 states and 1584 transitions. [2018-11-07 04:55:53,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 04:55:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1584 transitions. [2018-11-07 04:55:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-11-07 04:55:53,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:53,587 INFO L375 BasicCegarLoop]: trace histogram [40, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:53,587 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:53,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2028750520, now seen corresponding path program 29 times [2018-11-07 04:55:53,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:53,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:53,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6570 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 4335 trivial. 0 not checked. [2018-11-07 04:55:54,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:54,576 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:54,576 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:54,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:54,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:54,576 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:54,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:54,586 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:54,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 04:55:54,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:54,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6570 backedges. 727 proven. 335 refuted. 0 times theorem prover too weak. 5508 trivial. 0 not checked. [2018-11-07 04:55:55,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6570 backedges. 727 proven. 335 refuted. 0 times theorem prover too weak. 5508 trivial. 0 not checked. [2018-11-07 04:55:56,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:56,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16, 16] total 61 [2018-11-07 04:55:56,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:56,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 04:55:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 04:55:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=2840, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:55:56,207 INFO L87 Difference]: Start difference. First operand 1194 states and 1584 transitions. Second operand 47 states. [2018-11-07 04:56:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:44,139 INFO L93 Difference]: Finished difference Result 11239 states and 15471 transitions. [2018-11-07 04:56:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 418 states. [2018-11-07 04:56:44,140 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 519 [2018-11-07 04:56:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:44,155 INFO L225 Difference]: With dead ends: 11239 [2018-11-07 04:56:44,155 INFO L226 Difference]: Without dead ends: 10204 [2018-11-07 04:56:44,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1805 GetRequests, 1363 SyntacticMatches, 0 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91747 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=54665, Invalid=142027, Unknown=0, NotChecked=0, Total=196692 [2018-11-07 04:56:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10204 states. [2018-11-07 04:56:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10204 to 1248. [2018-11-07 04:56:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2018-11-07 04:56:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1658 transitions. [2018-11-07 04:56:44,780 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1658 transitions. Word has length 519 [2018-11-07 04:56:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:44,780 INFO L480 AbstractCegarLoop]: Abstraction has 1248 states and 1658 transitions. [2018-11-07 04:56:44,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 04:56:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1658 transitions. [2018-11-07 04:56:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-11-07 04:56:44,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:44,784 INFO L375 BasicCegarLoop]: trace histogram [42, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:56:44,784 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:44,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1343157852, now seen corresponding path program 30 times [2018-11-07 04:56:44,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:44,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:44,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:56:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:44,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7156 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 4769 trivial. 0 not checked. [2018-11-07 04:56:45,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:45,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:45,594 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:45,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:45,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:45,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:45,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:56:45,604 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:56:45,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:56:45,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:45,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7156 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 4769 trivial. 0 not checked. [2018-11-07 04:56:45,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 04:56:46,385 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 04:56:46,586 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:46,587 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 04:56:46,592 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 04:56:46,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:56:46 BoogieIcfgContainer [2018-11-07 04:56:46,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:56:46,593 INFO L168 Benchmark]: Toolchain (without parser) took 237371.93 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 04:56:46,593 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:56:46,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 04:56:46,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:56:46,595 INFO L168 Benchmark]: Boogie Preprocessor took 149.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-07 04:56:46,595 INFO L168 Benchmark]: RCFGBuilder took 721.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2018-11-07 04:56:46,596 INFO L168 Benchmark]: TraceAbstraction took 235942.40 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -709.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 04:56:46,601 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.23 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 502.66 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 51.07 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 149.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 721.70 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235942.40 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: -709.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 546 with TraceHistMax 42,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 85 locations, 1 error locations. TIMEOUT Result, 235.8s OverallTime, 34 OverallIterations, 42 TraceHistogramMax, 176.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7952 SDtfs, 91699 SDslu, 50178 SDs, 0 SdLazy, 50958 SolverSat, 25119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20503 GetRequests, 17822 SyntacticMatches, 1 SemanticMatches, 2680 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253875 ImplicationChecksByTransitivity, 104.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1248occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 41537 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 17014 NumberOfCodeBlocks, 15802 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 25408 ConstructedInterpolants, 0 QuantifiedInterpolants, 16951684 SizeOfPredicates, 63 NumberOfNonLiveVariables, 17154 ConjunctsInSsa, 497 ConjunctsInUnsatCore, 95 InterpolantComputations, 4 PerfectInterpolantSequences, 152378/208044 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown