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/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:21:47,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:21:47,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:21:47,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:21:47,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:21:47,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:21:47,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:21:47,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:21:47,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:21:47,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:21:47,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:21:47,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:21:47,691 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:21:47,692 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:21:47,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:21:47,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:21:47,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:21:47,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:21:47,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:21:47,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:21:47,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:21:47,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:21:47,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:21:47,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:21:47,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:21:47,714 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:21:47,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:21:47,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:21:47,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:21:47,718 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:21:47,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:21:47,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:21:47,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:21:47,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:21:47,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:21:47,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:21:47,721 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:21:47,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:21:47,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:21:47,738 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:21:47,738 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:21:47,739 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:21:47,739 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:21:47,739 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:21:47,739 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:21:47,739 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:21:47,740 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:21:47,740 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:21:47,740 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:21:47,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:21:47,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:21:47,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:21:47,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:21:47,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:21:47,742 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:21:47,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:21:47,742 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:21:47,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:21:47,742 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:21:47,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:21:47,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:21:47,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:21:47,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:21:47,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:21:47,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:21:47,745 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:21:47,745 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:21:47,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:21:47,745 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:21:47,746 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:21:47,746 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:21:47,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:21:47,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:21:47,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:21:47,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:21:47,830 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:21:47,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-07 04:21:47,902 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa73e6ac/755157450d044403b7f8e70ee13d995a/FLAG2a8deb5bd [2018-11-07 04:21:48,381 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:21:48,382 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-07 04:21:48,400 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa73e6ac/755157450d044403b7f8e70ee13d995a/FLAG2a8deb5bd [2018-11-07 04:21:48,413 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa73e6ac/755157450d044403b7f8e70ee13d995a [2018-11-07 04:21:48,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:21:48,425 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:21:48,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:21:48,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:21:48,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:21:48,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:48,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625553cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48, skipping insertion in model container [2018-11-07 04:21:48,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:48,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:21:48,492 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:21:48,856 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:21:48,861 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:21:48,950 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:21:48,966 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:21:48,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48 WrapperNode [2018-11-07 04:21:48,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:21:48,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:21:48,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:21:48,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:21:48,982 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:21:48" (1/1) ... [2018-11-07 04:21:49,008 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:21:48" (1/1) ... [2018-11-07 04:21:49,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:21:49,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:21:49,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:21:49,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:21:49,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:49,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:49,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:49,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:49,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:49,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:49,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (1/1) ... [2018-11-07 04:21:49,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:21:49,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:21:49,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:21:49,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:21:49,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (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:21:49,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:21:49,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:21:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:21:49,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:21:49,272 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:21:49,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:21:51,163 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:21:51,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:51 BoogieIcfgContainer [2018-11-07 04:21:51,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:21:51,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:21:51,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:21:51,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:21:51,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:21:48" (1/3) ... [2018-11-07 04:21:51,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54776bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:51, skipping insertion in model container [2018-11-07 04:21:51,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:21:48" (2/3) ... [2018-11-07 04:21:51,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54776bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:21:51, skipping insertion in model container [2018-11-07 04:21:51,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:21:51" (3/3) ... [2018-11-07 04:21:51,174 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-07 04:21:51,182 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:21:51,191 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:21:51,206 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:21:51,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:21:51,242 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:21:51,242 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:21:51,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:21:51,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:21:51,243 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:21:51,243 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:21:51,243 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:21:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-07 04:21:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:21:51,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:21:51,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:21:51,276 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:21:51,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:21:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-11-07 04:21:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:21:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:51,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:21:51,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:51,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:21:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:21:51,434 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:21:51,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:21:51,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:21:51,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:21:51,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:21:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:21:51,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:21:51,462 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-07 04:21:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:21:51,498 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-07 04:21:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:21:51,500 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-07 04:21:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:21:51,514 INFO L225 Difference]: With dead ends: 222 [2018-11-07 04:21:51,514 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 04:21:51,518 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:21:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 04:21:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-07 04:21:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-07 04:21:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-07 04:21:51,568 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-07 04:21:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:21:51,568 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-07 04:21:51,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:21:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-07 04:21:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 04:21:51,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:21:51,570 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:21:51,571 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:21:51,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:21:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-11-07 04:21:51,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:21:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:51,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:21:51,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:51,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:21:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:21:51,686 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:21:51,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:21:51,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:21:51,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:21:51,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:21:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:21:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:21:51,689 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-07 04:21:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:21:51,868 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-07 04:21:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:21:51,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 04:21:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:21:51,870 INFO L225 Difference]: With dead ends: 205 [2018-11-07 04:21:51,870 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 04:21:51,873 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:21:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 04:21:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-07 04:21:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 04:21:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-07 04:21:51,887 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-07 04:21:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:21:51,888 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-07 04:21:51,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:21:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-07 04:21:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:21:51,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:21:51,889 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:21:51,890 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:21:51,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:21:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-11-07 04:21:51,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:21:51,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:51,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:21:51,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:51,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:21:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:21:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:21:52,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:21:52,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:21:52,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:21:52,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:21:52,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:21:52,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:21:52,157 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-11-07 04:21:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:21:52,711 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-07 04:21:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:21:52,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-07 04:21:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:21:52,715 INFO L225 Difference]: With dead ends: 209 [2018-11-07 04:21:52,715 INFO L226 Difference]: Without dead ends: 190 [2018-11-07 04:21:52,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:21:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-07 04:21:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-07 04:21:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-07 04:21:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-07 04:21:52,735 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-07 04:21:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:21:52,736 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-07 04:21:52,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:21:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-07 04:21:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 04:21:52,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:21:52,740 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:21:52,744 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:21:52,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:21:52,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-11-07 04:21:52,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:21:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:52,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:21:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:52,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:21:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:21:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:21:52,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:21:52,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:21:52,873 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:21:52,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:21:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:21:52,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:21:52,875 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-07 04:21:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:21:53,034 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-07 04:21:53,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:21:53,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-07 04:21:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:21:53,036 INFO L225 Difference]: With dead ends: 297 [2018-11-07 04:21:53,036 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 04:21:53,038 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:21:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 04:21:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-07 04:21:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 04:21:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-07 04:21:53,049 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-07 04:21:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:21:53,050 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-07 04:21:53,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:21:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-07 04:21:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 04:21:53,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:21:53,051 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:21:53,052 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:21:53,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:21:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-11-07 04:21:53,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:21:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:21:53,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:53,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:21:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:21:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:21:53,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:21:53,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:21:53,129 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:21:53,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:21:53,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:21:53,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:21:53,131 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-07 04:21:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:21:53,348 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-07 04:21:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:21:53,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-07 04:21:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:21:53,350 INFO L225 Difference]: With dead ends: 230 [2018-11-07 04:21:53,350 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 04:21:53,351 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:21:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 04:21:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-07 04:21:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-07 04:21:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-07 04:21:53,359 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-07 04:21:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:21:53,360 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-07 04:21:53,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:21:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-07 04:21:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 04:21:53,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:21:53,362 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 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:21:53,362 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:21:53,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:21:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-11-07 04:21:53,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:21:53,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:53,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:21:53,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:21:53,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:21:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:21:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:21:53,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:21:53,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:21:53,579 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-07 04:21:53,581 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [233], [236], [239], [520], [523], [524], [525] [2018-11-07 04:21:53,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:21:53,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:21:54,816 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:21:57,398 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 04:21:57,401 INFO L272 AbstractInterpreter]: Visited 23 different actions 47 times. Merged at 15 different actions 19 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-11-07 04:21:57,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:21:57,434 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 04:21:58,234 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 91.92% of their original sizes. [2018-11-07 04:21:58,241 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 04:21:58,942 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-07 04:21:58,942 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 04:21:58,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:21:58,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-11-07 04:21:58,944 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:21:58,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 04:21:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 04:21:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:21:58,946 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 13 states. [2018-11-07 04:22:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:08,656 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2018-11-07 04:22:08,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:22:08,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-07 04:22:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:08,658 INFO L225 Difference]: With dead ends: 225 [2018-11-07 04:22:08,659 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 04:22:08,659 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:22:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 04:22:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-11-07 04:22:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 04:22:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2018-11-07 04:22:08,680 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 27 [2018-11-07 04:22:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:08,680 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2018-11-07 04:22:08,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 04:22:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2018-11-07 04:22:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 04:22:08,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:08,685 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-07 04:22:08,686 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:08,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-11-07 04:22:08,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:08,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:08,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:08,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:08,689 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:22:08,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:08,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:22:08,923 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 04:22:08,923 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [261], [276], [291], [294], [297], [300], [520], [523], [524], [525] [2018-11-07 04:22:08,926 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:22:08,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:22:09,415 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:22:12,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:22:12,487 INFO L272 AbstractInterpreter]: Visited 28 different actions 57 times. Merged at 21 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 43 variables. [2018-11-07 04:22:12,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:12,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:22:12,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:12,495 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:22:12,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:12,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:22:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:12,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:22:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:22:12,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:22:13,047 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2018-11-07 04:22:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:22:13,172 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:22:13,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-07 04:22:13,173 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:22:13,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:22:13,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:22:13,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:22:13,174 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand 3 states. [2018-11-07 04:22:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:13,223 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2018-11-07 04:22:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:22:13,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-07 04:22:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:13,225 INFO L225 Difference]: With dead ends: 138 [2018-11-07 04:22:13,226 INFO L226 Difference]: Without dead ends: 132 [2018-11-07 04:22:13,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:22:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-07 04:22:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-11-07 04:22:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 04:22:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2018-11-07 04:22:13,242 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 31 [2018-11-07 04:22:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:13,242 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2018-11-07 04:22:13,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:22:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2018-11-07 04:22:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 04:22:13,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:13,244 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-11-07 04:22:13,245 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:13,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-11-07 04:22:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:13,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:13,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:13,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 04:22:13,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:22:13,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:22:13,330 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:22:13,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:22:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:22:13,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:22:13,331 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand 3 states. [2018-11-07 04:22:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:13,563 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2018-11-07 04:22:13,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:22:13,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-07 04:22:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:13,565 INFO L225 Difference]: With dead ends: 218 [2018-11-07 04:22:13,565 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 04:22:13,566 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:22:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 04:22:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-07 04:22:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 04:22:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2018-11-07 04:22:13,575 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 36 [2018-11-07 04:22:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:13,575 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2018-11-07 04:22:13,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:22:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2018-11-07 04:22:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 04:22:13,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:13,577 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-11-07 04:22:13,578 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:13,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-11-07 04:22:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:13,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 04:22:13,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:13,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:22:13,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-07 04:22:13,936 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [520], [523], [524], [525] [2018-11-07 04:22:13,938 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:22:13,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:22:14,416 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:22:22,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:22:22,598 INFO L272 AbstractInterpreter]: Visited 30 different actions 136 times. Merged at 23 different actions 88 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 41 variables. [2018-11-07 04:22:22,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:22,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:22:22,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:22,634 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:22:22,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:22,648 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:22:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:22,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:22:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 04:22:22,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:22:23,372 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2018-11-07 04:22:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 04:22:23,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:22:23,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 04:22:23,613 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:22:23,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:22:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:22:23,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:22:23,614 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand 5 states. [2018-11-07 04:22:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:24,367 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2018-11-07 04:22:24,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:22:24,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-07 04:22:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:24,369 INFO L225 Difference]: With dead ends: 194 [2018-11-07 04:22:24,372 INFO L226 Difference]: Without dead ends: 188 [2018-11-07 04:22:24,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:22:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-07 04:22:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2018-11-07 04:22:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-07 04:22:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 269 transitions. [2018-11-07 04:22:24,382 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 269 transitions. Word has length 37 [2018-11-07 04:22:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:24,383 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 269 transitions. [2018-11-07 04:22:24,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:22:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 269 transitions. [2018-11-07 04:22:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 04:22:24,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:24,385 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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:22:24,385 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:24,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:24,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1280054677, now seen corresponding path program 1 times [2018-11-07 04:22:24,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:24,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:24,386 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 04:22:24,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:24,658 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:22:24,658 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-07 04:22:24,658 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [344], [347], [350], [520], [523], [524], [525] [2018-11-07 04:22:24,661 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:22:24,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:22:25,088 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:22:32,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:22:32,157 INFO L272 AbstractInterpreter]: Visited 31 different actions 139 times. Merged at 24 different actions 89 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 42 variables. [2018-11-07 04:22:32,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:32,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:22:32,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:32,167 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:22:32,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:32,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:22:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:32,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:22:32,498 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-11-07 04:22:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 04:22:32,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:22:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:22:32,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:22:32,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2018-11-07 04:22:32,838 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:22:32,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:22:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:22:32,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:22:32,840 INFO L87 Difference]: Start difference. First operand 179 states and 269 transitions. Second operand 5 states. [2018-11-07 04:22:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:33,904 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2018-11-07 04:22:33,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:22:33,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-07 04:22:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:33,906 INFO L225 Difference]: With dead ends: 268 [2018-11-07 04:22:33,906 INFO L226 Difference]: Without dead ends: 254 [2018-11-07 04:22:33,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:22:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-07 04:22:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-11-07 04:22:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-07 04:22:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2018-11-07 04:22:33,922 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 38 [2018-11-07 04:22:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:33,923 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2018-11-07 04:22:33,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:22:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2018-11-07 04:22:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 04:22:33,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:33,924 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-11-07 04:22:33,927 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:33,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-11-07 04:22:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:33,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:34,185 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 04:22:34,342 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 04:22:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:22:34,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:34,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:22:34,483 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-07 04:22:34,483 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [520], [523], [524], [525] [2018-11-07 04:22:34,485 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:22:34,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:22:34,800 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:22:44,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:22:44,326 INFO L272 AbstractInterpreter]: Visited 33 different actions 148 times. Merged at 26 different actions 97 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 44 variables. [2018-11-07 04:22:44,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:44,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:22:44,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:44,341 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:22:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:44,351 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:22:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:44,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:22:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:22:44,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:22:45,125 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 12 [2018-11-07 04:22:45,736 WARN L179 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-11-07 04:22:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:22:45,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:22:45,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-11-07 04:22:45,834 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:22:45,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:22:45,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:22:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:22:45,835 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 6 states. [2018-11-07 04:22:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:46,343 INFO L93 Difference]: Finished difference Result 260 states and 381 transitions. [2018-11-07 04:22:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:22:46,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-07 04:22:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:46,346 INFO L225 Difference]: With dead ends: 260 [2018-11-07 04:22:46,346 INFO L226 Difference]: Without dead ends: 258 [2018-11-07 04:22:46,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:22:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-07 04:22:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-11-07 04:22:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-07 04:22:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2018-11-07 04:22:46,358 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 40 [2018-11-07 04:22:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:46,358 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2018-11-07 04:22:46,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:22:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2018-11-07 04:22:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 04:22:46,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:46,359 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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:22:46,360 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:46,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:46,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-11-07 04:22:46,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:46,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:46,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:46,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:46,361 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 04:22:46,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:22:46,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:22:46,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:22:46,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:22:46,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:22:46,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:22:46,441 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 3 states. [2018-11-07 04:22:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:46,718 INFO L93 Difference]: Finished difference Result 440 states and 652 transitions. [2018-11-07 04:22:46,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:22:46,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-07 04:22:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:46,720 INFO L225 Difference]: With dead ends: 440 [2018-11-07 04:22:46,720 INFO L226 Difference]: Without dead ends: 235 [2018-11-07 04:22:46,721 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:22:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-07 04:22:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-11-07 04:22:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-07 04:22:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2018-11-07 04:22:46,731 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 41 [2018-11-07 04:22:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:46,731 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2018-11-07 04:22:46,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:22:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2018-11-07 04:22:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 04:22:46,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:46,732 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2018-11-07 04:22:46,732 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:46,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-11-07 04:22:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:46,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 04:22:46,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:22:46,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:22:46,819 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:22:46,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:22:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:22:46,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:22:46,820 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand 3 states. [2018-11-07 04:22:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:22:47,107 INFO L93 Difference]: Finished difference Result 318 states and 458 transitions. [2018-11-07 04:22:47,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:22:47,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-07 04:22:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:22:47,109 INFO L225 Difference]: With dead ends: 318 [2018-11-07 04:22:47,109 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 04:22:47,110 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:22:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 04:22:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-07 04:22:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-07 04:22:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2018-11-07 04:22:47,118 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 50 [2018-11-07 04:22:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:22:47,119 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2018-11-07 04:22:47,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:22:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2018-11-07 04:22:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 04:22:47,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:22:47,120 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1, 1] [2018-11-07 04:22:47,120 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:22:47,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:47,120 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-11-07 04:22:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:22:47,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:47,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:47,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:22:47,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:22:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 04:22:47,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:47,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:22:47,504 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-07 04:22:47,504 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [520], [523], [524], [525] [2018-11-07 04:22:47,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:22:47,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:22:48,030 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:22:59,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:22:59,599 INFO L272 AbstractInterpreter]: Visited 39 different actions 211 times. Merged at 32 different actions 142 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2018-11-07 04:22:59,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:22:59,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:22:59,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:22:59,606 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:22:59,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:22:59,618 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:22:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:22:59,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:22:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:22:59,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:22:59,938 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-07 04:23:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:23:00,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:23:00,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-07 04:23:00,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:23:00,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:23:00,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:23:00,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:23:00,104 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand 9 states. [2018-11-07 04:23:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:23:00,821 INFO L93 Difference]: Finished difference Result 193 states and 268 transitions. [2018-11-07 04:23:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:23:00,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-07 04:23:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:23:00,824 INFO L225 Difference]: With dead ends: 193 [2018-11-07 04:23:00,824 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 04:23:00,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:23:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 04:23:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2018-11-07 04:23:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-07 04:23:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2018-11-07 04:23:00,836 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 259 transitions. Word has length 51 [2018-11-07 04:23:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:23:00,836 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 259 transitions. [2018-11-07 04:23:00,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:23:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 259 transitions. [2018-11-07 04:23:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 04:23:00,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:23:00,837 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:23:00,837 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:23:00,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:23:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash 412447638, now seen corresponding path program 1 times [2018-11-07 04:23:00,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:23:00,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:23:00,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:23:00,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:23:00,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:23:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:23:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:23:01,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:23:01,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:23:01,267 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-07 04:23:01,267 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [506], [520], [523], [524], [525] [2018-11-07 04:23:01,269 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:23:01,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:23:01,639 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:23:12,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:23:12,044 INFO L272 AbstractInterpreter]: Visited 43 different actions 232 times. Merged at 36 different actions 160 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-07 04:23:12,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:23:12,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:23:12,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:23:12,046 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:23:12,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:23:12,055 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:23:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:23:12,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:23:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:23:12,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:23:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:23:12,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:23:12,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2018-11-07 04:23:12,731 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:23:12,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:23:12,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:23:12,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:23:12,732 INFO L87 Difference]: Start difference. First operand 184 states and 259 transitions. Second operand 9 states. [2018-11-07 04:23:13,035 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 12 [2018-11-07 04:23:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:23:13,330 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions. [2018-11-07 04:23:13,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 04:23:13,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-07 04:23:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:23:13,333 INFO L225 Difference]: With dead ends: 196 [2018-11-07 04:23:13,333 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 04:23:13,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:23:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 04:23:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2018-11-07 04:23:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-07 04:23:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2018-11-07 04:23:13,348 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 55 [2018-11-07 04:23:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:23:13,348 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2018-11-07 04:23:13,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:23:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-11-07 04:23:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 04:23:13,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:23:13,352 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-11-07 04:23:13,352 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:23:13,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:23:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-11-07 04:23:13,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:23:13,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:23:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:23:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:23:13,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:23:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:23:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:23:13,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:23:13,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:23:13,632 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-07 04:23:13,632 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [48], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-07 04:23:13,634 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:23:13,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:23:13,992 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-07 04:25:35,172 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-07 04:25:35,172 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-07 04:25:35,173 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:25:35,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:25:35,173 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:25:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:25:35,181 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:25:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:25:35,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:25:35,269 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 04:25:35,470 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:25:35,470 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 04:25:35,475 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 04:25:35,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:25:35 BoogieIcfgContainer [2018-11-07 04:25:35,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:25:35,476 INFO L168 Benchmark]: Toolchain (without parser) took 227052.38 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 655.1 MB. Max. memory is 7.1 GB. [2018-11-07 04:25:35,478 INFO L168 Benchmark]: CDTParser took 0.19 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:25:35,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-07 04:25:35,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.51 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:25:35,480 INFO L168 Benchmark]: Boogie Preprocessor took 169.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2018-11-07 04:25:35,481 INFO L168 Benchmark]: RCFGBuilder took 1968.47 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: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2018-11-07 04:25:35,482 INFO L168 Benchmark]: TraceAbstraction took 224310.96 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 3.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 650.2 MB. Max. memory is 7.1 GB. [2018-11-07 04:25:35,486 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.19 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 541.06 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.51 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 169.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1968.47 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: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224310.96 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 3.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 650.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. TIMEOUT Result, 224.2s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 15.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2242 SDtfs, 1373 SDslu, 3313 SDs, 0 SdLazy, 865 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 593 GetRequests, 512 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 197.9s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.943293885601578 AbsIntWeakeningRatio, 1.7307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 662.5769230769231 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 66 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 974 ConstructedInterpolants, 35 QuantifiedInterpolants, 285517 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1778 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 252/463 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown