java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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-d380424 [2018-10-24 22:35:13,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 22:35:13,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 22:35:13,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 22:35:13,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 22:35:13,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 22:35:13,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 22:35:13,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 22:35:13,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 22:35:13,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 22:35:13,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 22:35:13,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 22:35:13,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 22:35:13,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 22:35:13,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 22:35:13,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 22:35:13,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 22:35:13,712 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 22:35:13,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 22:35:13,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 22:35:13,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 22:35:13,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 22:35:13,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 22:35:13,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 22:35:13,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 22:35:13,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 22:35:13,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 22:35:13,731 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 22:35:13,732 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 22:35:13,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 22:35:13,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 22:35:13,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 22:35:13,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 22:35:13,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 22:35:13,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 22:35:13,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 22:35:13,738 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 22:35:13,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 22:35:13,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 22:35:13,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 22:35:13,765 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 22:35:13,765 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 22:35:13,766 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 22:35:13,766 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 22:35:13,766 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 22:35:13,766 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 22:35:13,767 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 22:35:13,770 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 22:35:13,771 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 22:35:13,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 22:35:13,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 22:35:13,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 22:35:13,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 22:35:13,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 22:35:13,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 22:35:13,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 22:35:13,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 22:35:13,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 22:35:13,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 22:35:13,773 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 22:35:13,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 22:35:13,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 22:35:13,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 22:35:13,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 22:35:13,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 22:35:13,776 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 22:35:13,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 22:35:13,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 22:35:13,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 22:35:13,777 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 22:35:13,777 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 22:35:13,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 22:35:13,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 22:35:13,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 22:35:13,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 22:35:13,848 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 22:35:13,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 22:35:13,914 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/849b187ff/34c71050c51e4f5498157f3590e368d2/FLAG51e5d9a76 [2018-10-24 22:35:14,460 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 22:35:14,461 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 22:35:14,474 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/849b187ff/34c71050c51e4f5498157f3590e368d2/FLAG51e5d9a76 [2018-10-24 22:35:14,497 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/849b187ff/34c71050c51e4f5498157f3590e368d2 [2018-10-24 22:35:14,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 22:35:14,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 22:35:14,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 22:35:14,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 22:35:14,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 22:35:14,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:35:14" (1/1) ... [2018-10-24 22:35:14,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441f49ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:14, skipping insertion in model container [2018-10-24 22:35:14,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:35:14" (1/1) ... [2018-10-24 22:35:14,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 22:35:14,594 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 22:35:14,990 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:35:14,997 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 22:35:15,105 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 22:35:15,134 INFO L193 MainTranslator]: Completed translation [2018-10-24 22:35:15,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15 WrapperNode [2018-10-24 22:35:15,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 22:35:15,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 22:35:15,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 22:35:15,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 22:35:15,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 22:35:15,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 22:35:15,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 22:35:15,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 22:35:15,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... [2018-10-24 22:35:15,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 22:35:15,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 22:35:15,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 22:35:15,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 22:35:15,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:35:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 22:35:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 22:35:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 22:35:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 22:35:15,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 22:35:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 22:35:17,307 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 22:35:17,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:35:17 BoogieIcfgContainer [2018-10-24 22:35:17,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 22:35:17,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 22:35:17,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 22:35:17,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 22:35:17,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:35:14" (1/3) ... [2018-10-24 22:35:17,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2e92b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:35:17, skipping insertion in model container [2018-10-24 22:35:17,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:35:15" (2/3) ... [2018-10-24 22:35:17,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2e92b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:35:17, skipping insertion in model container [2018-10-24 22:35:17,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:35:17" (3/3) ... [2018-10-24 22:35:17,316 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 22:35:17,325 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 22:35:17,334 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 22:35:17,351 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 22:35:17,384 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 22:35:17,384 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 22:35:17,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 22:35:17,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 22:35:17,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 22:35:17,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 22:35:17,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 22:35:17,385 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 22:35:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-10-24 22:35:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-24 22:35:17,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:17,413 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:35:17,415 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:17,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:17,422 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-10-24 22:35:17,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:17,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:17,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:17,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:17,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:17,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:17,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 22:35:17,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:17,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 22:35:17,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 22:35:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 22:35:17,594 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-10-24 22:35:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:17,642 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-10-24 22:35:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 22:35:17,645 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-24 22:35:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:17,662 INFO L225 Difference]: With dead ends: 222 [2018-10-24 22:35:17,662 INFO L226 Difference]: Without dead ends: 104 [2018-10-24 22:35:17,667 INFO L605 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-10-24 22:35:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-24 22:35:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-24 22:35:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-24 22:35:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-10-24 22:35:17,716 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-10-24 22:35:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:17,717 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-10-24 22:35:17,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 22:35:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-10-24 22:35:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 22:35:17,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:17,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:35:17,719 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:17,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:17,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-10-24 22:35:17,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:17,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:17,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:17,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:35:17,812 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:17,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:17,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:35:17,814 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-10-24 22:35:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:18,106 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-10-24 22:35:18,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:18,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-24 22:35:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:18,110 INFO L225 Difference]: With dead ends: 205 [2018-10-24 22:35:18,110 INFO L226 Difference]: Without dead ends: 107 [2018-10-24 22:35:18,112 INFO L605 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-10-24 22:35:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-24 22:35:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-24 22:35:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-24 22:35:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-10-24 22:35:18,142 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-10-24 22:35:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:18,143 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-10-24 22:35:18,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-10-24 22:35:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 22:35:18,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:18,145 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:35:18,146 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:18,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-10-24 22:35:18,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:18,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:18,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:18,148 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:35:18,398 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:18,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:35:18,400 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-10-24 22:35:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:18,806 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-10-24 22:35:18,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:18,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 22:35:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:18,810 INFO L225 Difference]: With dead ends: 209 [2018-10-24 22:35:18,810 INFO L226 Difference]: Without dead ends: 190 [2018-10-24 22:35:18,811 INFO L605 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-10-24 22:35:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-24 22:35:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-10-24 22:35:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-24 22:35:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-10-24 22:35:18,828 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-10-24 22:35:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:18,829 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-10-24 22:35:18,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-10-24 22:35:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 22:35:18,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:18,831 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-10-24 22:35:18,831 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:18,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-10-24 22:35:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:18,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:18,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:18,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:18,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:35:18,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:18,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:35:18,940 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-10-24 22:35:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:19,001 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-10-24 22:35:19,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:19,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-24 22:35:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:19,006 INFO L225 Difference]: With dead ends: 297 [2018-10-24 22:35:19,006 INFO L226 Difference]: Without dead ends: 128 [2018-10-24 22:35:19,007 INFO L605 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-10-24 22:35:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-24 22:35:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-24 22:35:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-24 22:35:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-10-24 22:35:19,018 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-10-24 22:35:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:19,019 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-10-24 22:35:19,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-10-24 22:35:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 22:35:19,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:19,021 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-10-24 22:35:19,021 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:19,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-10-24 22:35:19,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:19,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:19,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:19,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:19,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 22:35:19,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:19,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:35:19,134 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:19,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:35:19,135 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-10-24 22:35:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:19,336 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-10-24 22:35:19,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:19,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-24 22:35:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:19,339 INFO L225 Difference]: With dead ends: 230 [2018-10-24 22:35:19,339 INFO L226 Difference]: Without dead ends: 111 [2018-10-24 22:35:19,341 INFO L605 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-10-24 22:35:19,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-24 22:35:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-24 22:35:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-24 22:35:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-10-24 22:35:19,362 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-10-24 22:35:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:19,363 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-10-24 22:35:19,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-10-24 22:35:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 22:35:19,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:19,367 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-10-24 22:35:19,367 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:19,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-10-24 22:35:19,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:19,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:19,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:19,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:19,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:19,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:19,631 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:19,632 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-24 22:35:19,633 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-10-24 22:35:19,686 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:19,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:20,744 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:23,341 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 22:35:23,343 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-10-24 22:35:23,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:23,364 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 22:35:24,226 INFO L232 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 91.92% of their original sizes. [2018-10-24 22:35:24,227 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 22:35:24,828 INFO L413 sIntCurrentIteration]: We have 26 unified AI predicates [2018-10-24 22:35:24,829 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 22:35:24,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:35:24,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-24 22:35:24,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:24,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 22:35:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 22:35:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-24 22:35:24,832 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 13 states. [2018-10-24 22:35:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:35,885 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2018-10-24 22:35:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 22:35:35,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-10-24 22:35:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:35,888 INFO L225 Difference]: With dead ends: 225 [2018-10-24 22:35:35,888 INFO L226 Difference]: Without dead ends: 141 [2018-10-24 22:35:35,890 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-10-24 22:35:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-24 22:35:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-10-24 22:35:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-24 22:35:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2018-10-24 22:35:35,905 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 27 [2018-10-24 22:35:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:35,906 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2018-10-24 22:35:35,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 22:35:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2018-10-24 22:35:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 22:35:35,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:35,907 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-10-24 22:35:35,908 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:35,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:35,908 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-10-24 22:35:35,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:35,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:35,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:35,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:36,713 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-10-24 22:35:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:36,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:36,717 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:36,717 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-24 22:35:36,718 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-10-24 22:35:36,720 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:36,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:37,435 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:40,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:40,524 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-10-24 22:35:40,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:40,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:40,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:40,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:35:40,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:40,574 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:35:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:40,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 22:35:40,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:41,088 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2018-10-24 22:35:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 22:35:41,221 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 22:35:41,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-24 22:35:41,222 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:41,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:41,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:41,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:35:41,223 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand 3 states. [2018-10-24 22:35:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:41,279 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2018-10-24 22:35:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:41,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-24 22:35:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:41,281 INFO L225 Difference]: With dead ends: 138 [2018-10-24 22:35:41,281 INFO L226 Difference]: Without dead ends: 132 [2018-10-24 22:35:41,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:35:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-24 22:35:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-24 22:35:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-24 22:35:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2018-10-24 22:35:41,308 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 31 [2018-10-24 22:35:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:41,308 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2018-10-24 22:35:41,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2018-10-24 22:35:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 22:35:41,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:41,310 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-10-24 22:35:41,310 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:41,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:41,311 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-10-24 22:35:41,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:41,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:41,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:41,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 22:35:41,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:35:41,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:35:41,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:35:41,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:35:41,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:35:41,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:35:41,415 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand 3 states. [2018-10-24 22:35:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:41,529 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2018-10-24 22:35:41,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:35:41,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-24 22:35:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:41,531 INFO L225 Difference]: With dead ends: 218 [2018-10-24 22:35:41,531 INFO L226 Difference]: Without dead ends: 133 [2018-10-24 22:35:41,531 INFO L605 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-10-24 22:35:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-24 22:35:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-24 22:35:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-24 22:35:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2018-10-24 22:35:41,541 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 36 [2018-10-24 22:35:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:41,541 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2018-10-24 22:35:41,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:35:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2018-10-24 22:35:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 22:35:41,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:41,543 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-10-24 22:35:41,543 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:41,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:41,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-10-24 22:35:41,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:41,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:41,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 22:35:41,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:41,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:41,748 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-24 22:35:41,748 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-10-24 22:35:41,751 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:41,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:42,238 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:49,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:49,270 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-10-24 22:35:49,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:49,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:49,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:49,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:35:49,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:49,288 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:35:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:49,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 22:35:49,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:49,919 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2018-10-24 22:35:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 22:35:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:35:50,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-24 22:35:50,155 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:35:50,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 22:35:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 22:35:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:35:50,160 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand 5 states. [2018-10-24 22:35:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:50,630 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2018-10-24 22:35:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 22:35:50,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-24 22:35:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:50,633 INFO L225 Difference]: With dead ends: 194 [2018-10-24 22:35:50,633 INFO L226 Difference]: Without dead ends: 188 [2018-10-24 22:35:50,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 22:35:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-24 22:35:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2018-10-24 22:35:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-24 22:35:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 269 transitions. [2018-10-24 22:35:50,645 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 269 transitions. Word has length 37 [2018-10-24 22:35:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:50,646 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 269 transitions. [2018-10-24 22:35:50,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 22:35:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 269 transitions. [2018-10-24 22:35:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-24 22:35:50,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:50,647 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-10-24 22:35:50,648 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:50,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1280054677, now seen corresponding path program 1 times [2018-10-24 22:35:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:50,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 22:35:50,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:50,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:50,899 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-24 22:35:50,899 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-10-24 22:35:50,901 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:50,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:51,355 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:35:57,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:35:57,164 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-10-24 22:35:57,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:57,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:35:57,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:57,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:35:57,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:57,181 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:35:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:57,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:35:57,501 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-24 22:35:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 22:35:57,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:35:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 22:35:57,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:35:57,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2018-10-24 22:35:57,716 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:35:57,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 22:35:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 22:35:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 22:35:57,718 INFO L87 Difference]: Start difference. First operand 179 states and 269 transitions. Second operand 5 states. [2018-10-24 22:35:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:35:58,605 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2018-10-24 22:35:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 22:35:58,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-24 22:35:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:35:58,611 INFO L225 Difference]: With dead ends: 268 [2018-10-24 22:35:58,612 INFO L226 Difference]: Without dead ends: 254 [2018-10-24 22:35:58,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 22:35:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-24 22:35:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-10-24 22:35:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-24 22:35:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2018-10-24 22:35:58,632 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 38 [2018-10-24 22:35:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:35:58,632 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2018-10-24 22:35:58,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 22:35:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2018-10-24 22:35:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 22:35:58,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:35:58,638 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-10-24 22:35:58,639 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:35:58,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:35:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-10-24 22:35:58,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:35:58,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:58,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:35:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:35:58,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:35:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:35:58,913 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 22:35:59,094 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 22:35:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:35:59,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:35:59,191 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:35:59,191 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-24 22:35:59,191 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-10-24 22:35:59,193 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:35:59,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:35:59,548 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:36:07,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:36:07,614 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-10-24 22:36:07,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:07,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:36:07,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:36:07,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:36:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:07,642 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:36:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:07,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:36:07,890 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-24 22:36:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:36:07,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:36:08,451 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-24 22:36:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:36:08,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:36:08,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-10-24 22:36:08,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:36:08,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 22:36:08,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 22:36:08,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:36:08,518 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 6 states. [2018-10-24 22:36:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:36:09,338 INFO L93 Difference]: Finished difference Result 260 states and 381 transitions. [2018-10-24 22:36:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 22:36:09,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-24 22:36:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:36:09,341 INFO L225 Difference]: With dead ends: 260 [2018-10-24 22:36:09,342 INFO L226 Difference]: Without dead ends: 258 [2018-10-24 22:36:09,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 22:36:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-24 22:36:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-10-24 22:36:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-24 22:36:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2018-10-24 22:36:09,354 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 40 [2018-10-24 22:36:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:36:09,354 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2018-10-24 22:36:09,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 22:36:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2018-10-24 22:36:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-24 22:36:09,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:36:09,355 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-10-24 22:36:09,356 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:36:09,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-10-24 22:36:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:36:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:09,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:36:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:09,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-10-24 22:36:09,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:36:09,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:36:09,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:36:09,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:36:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:36:09,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:36:09,441 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 3 states. [2018-10-24 22:36:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:36:09,718 INFO L93 Difference]: Finished difference Result 440 states and 652 transitions. [2018-10-24 22:36:09,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:36:09,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-24 22:36:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:36:09,721 INFO L225 Difference]: With dead ends: 440 [2018-10-24 22:36:09,721 INFO L226 Difference]: Without dead ends: 235 [2018-10-24 22:36:09,722 INFO L605 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-10-24 22:36:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-24 22:36:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-24 22:36:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-24 22:36:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2018-10-24 22:36:09,734 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 41 [2018-10-24 22:36:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:36:09,735 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2018-10-24 22:36:09,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:36:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2018-10-24 22:36:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 22:36:09,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:36:09,736 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-10-24 22:36:09,736 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:36:09,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-10-24 22:36:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:36:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:09,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:36:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-24 22:36:09,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 22:36:09,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 22:36:09,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 22:36:09,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 22:36:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 22:36:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 22:36:09,841 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand 3 states. [2018-10-24 22:36:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:36:10,141 INFO L93 Difference]: Finished difference Result 318 states and 458 transitions. [2018-10-24 22:36:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 22:36:10,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-24 22:36:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:36:10,143 INFO L225 Difference]: With dead ends: 318 [2018-10-24 22:36:10,144 INFO L226 Difference]: Without dead ends: 150 [2018-10-24 22:36:10,144 INFO L605 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-10-24 22:36:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-24 22:36:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-24 22:36:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-24 22:36:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2018-10-24 22:36:10,155 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 50 [2018-10-24 22:36:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:36:10,155 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2018-10-24 22:36:10,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 22:36:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2018-10-24 22:36:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 22:36:10,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:36:10,156 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-10-24 22:36:10,156 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:36:10,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-10-24 22:36:10,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:36:10,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:10,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:10,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:36:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 22:36:10,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:36:10,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:36:10,582 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-24 22:36:10,582 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-10-24 22:36:10,584 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:36:10,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:36:11,008 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:36:22,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:36:22,529 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-10-24 22:36:22,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:22,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:36:22,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:36:22,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:36:22,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:22,542 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:36:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:22,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:36:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:36:22,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:36:22,834 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-10-24 22:36:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:36:22,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:36:22,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-10-24 22:36:22,926 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:36:22,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 22:36:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 22:36:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-24 22:36:22,928 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand 9 states. [2018-10-24 22:36:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:36:23,472 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2018-10-24 22:36:23,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 22:36:23,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-24 22:36:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:36:23,474 INFO L225 Difference]: With dead ends: 191 [2018-10-24 22:36:23,474 INFO L226 Difference]: Without dead ends: 187 [2018-10-24 22:36:23,475 INFO L605 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-10-24 22:36:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-24 22:36:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-10-24 22:36:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-24 22:36:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2018-10-24 22:36:23,485 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 51 [2018-10-24 22:36:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:36:23,485 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2018-10-24 22:36:23,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 22:36:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-10-24 22:36:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-24 22:36:23,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:36:23,486 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-10-24 22:36:23,487 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:36:23,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:36:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-10-24 22:36:23,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:36:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:23,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:36:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:36:23,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:36:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:36:23,737 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 22:36:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:36:23,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:36:23,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:36:23,896 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-24 22:36:23,896 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-10-24 22:36:23,898 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:36:23,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:36:24,249 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 22:39:04,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 22:39:04,828 INFO L272 AbstractInterpreter]: Visited 44 different actions 2796 times. Merged at 37 different actions 2398 times. Widened at 5 different actions 158 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-10-24 22:39:04,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:04,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 22:39:04,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:04,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:39:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:04,846 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:39:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:04,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:39:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:05,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 22:39:05,549 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 25 [2018-10-24 22:39:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 22:39:05,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 22:39:05,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-24 22:39:05,987 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 22:39:05,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 22:39:05,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 22:39:05,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-24 22:39:05,989 INFO L87 Difference]: Start difference. First operand 184 states and 258 transitions. Second operand 9 states. [2018-10-24 22:39:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 22:39:06,616 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2018-10-24 22:39:06,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 22:39:06,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-24 22:39:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 22:39:06,618 INFO L225 Difference]: With dead ends: 188 [2018-10-24 22:39:06,618 INFO L226 Difference]: Without dead ends: 186 [2018-10-24 22:39:06,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-24 22:39:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-24 22:39:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-24 22:39:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-24 22:39:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2018-10-24 22:39:06,628 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 61 [2018-10-24 22:39:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 22:39:06,628 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2018-10-24 22:39:06,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 22:39:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2018-10-24 22:39:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-24 22:39:06,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 22:39:06,630 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 22:39:06,630 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 22:39:06,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 22:39:06,630 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-10-24 22:39:06,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 22:39:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:06,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 22:39:06,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 22:39:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:06,877 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 22:39:07,052 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 22:39:07,264 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 22:39:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 22:39:07,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:07,419 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 22:39:07,419 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-10-24 22:39:07,419 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-24 22:39:07,422 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 22:39:07,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 22:39:07,764 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-10-24 22:39:24,318 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-10-24 22:39:24,319 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-10-24 22:39:24,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 22:39:24,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 22:39:24,319 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 22:39:24,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 22:39:24,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 22:39:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 22:39:24,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 22:39:24,409 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 22:39:24,609 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 22:39:24,610 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 22:39:24,615 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 22:39:24,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:39:24 BoogieIcfgContainer [2018-10-24 22:39:24,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 22:39:24,617 INFO L168 Benchmark]: Toolchain (without parser) took 250106.75 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -474.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 22:39:24,618 INFO L168 Benchmark]: CDTParser took 0.20 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-10-24 22:39:24,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.76 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-10-24 22:39:24,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.67 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-10-24 22:39:24,619 INFO L168 Benchmark]: Boogie Preprocessor took 107.18 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-10-24 22:39:24,620 INFO L168 Benchmark]: RCFGBuilder took 2028.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2018-10-24 22:39:24,621 INFO L168 Benchmark]: TraceAbstraction took 247307.53 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 244.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 22:39:24,625 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.20 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 622.76 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 36.67 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 107.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2028.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247307.53 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 244.9 MB). Peak memory consumption was 2.2 GB. 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 71 with TraceHistMax 7,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, 247.2s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 16.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2265 SDtfs, 1372 SDslu, 3513 SDs, 0 SdLazy, 900 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 604 GetRequests, 524 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 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, 219.6s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.943293885601578 AbsIntWeakeningRatio, 1.7307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 662.5769230769231 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 55 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 992 ConstructedInterpolants, 78 QuantifiedInterpolants, 397393 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 264/514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown