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-1dbac8b [2018-10-27 03:58:38,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 03:58:38,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 03:58:38,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 03:58:38,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 03:58:38,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 03:58:38,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 03:58:38,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 03:58:38,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 03:58:38,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 03:58:38,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 03:58:38,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 03:58:38,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 03:58:38,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 03:58:38,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 03:58:38,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 03:58:38,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 03:58:38,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 03:58:38,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 03:58:38,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 03:58:38,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 03:58:38,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 03:58:38,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 03:58:38,417 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 03:58:38,417 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 03:58:38,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 03:58:38,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 03:58:38,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 03:58:38,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 03:58:38,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 03:58:38,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 03:58:38,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 03:58:38,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 03:58:38,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 03:58:38,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 03:58:38,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 03:58:38,425 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-27 03:58:38,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 03:58:38,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 03:58:38,442 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 03:58:38,442 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 03:58:38,442 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 03:58:38,442 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 03:58:38,442 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 03:58:38,443 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 03:58:38,443 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 03:58:38,443 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 03:58:38,443 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 03:58:38,443 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 03:58:38,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 03:58:38,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 03:58:38,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 03:58:38,445 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 03:58:38,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 03:58:38,445 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 03:58:38,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 03:58:38,445 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 03:58:38,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 03:58:38,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 03:58:38,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 03:58:38,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 03:58:38,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 03:58:38,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 03:58:38,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 03:58:38,447 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 03:58:38,447 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 03:58:38,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 03:58:38,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 03:58:38,448 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 03:58:38,448 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 03:58:38,448 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 03:58:38,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 03:58:38,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 03:58:38,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 03:58:38,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 03:58:38,519 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 03:58:38,520 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-27 03:58:38,569 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b872d2fc/4c1ca10b87ea4567a085c8d6843749c3/FLAG97cfda89c [2018-10-27 03:58:39,119 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 03:58:39,120 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-27 03:58:39,134 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b872d2fc/4c1ca10b87ea4567a085c8d6843749c3/FLAG97cfda89c [2018-10-27 03:58:39,148 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b872d2fc/4c1ca10b87ea4567a085c8d6843749c3 [2018-10-27 03:58:39,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 03:58:39,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 03:58:39,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 03:58:39,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 03:58:39,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 03:58:39,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46764b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39, skipping insertion in model container [2018-10-27 03:58:39,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 03:58:39,238 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 03:58:39,666 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 03:58:39,674 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 03:58:39,791 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 03:58:39,826 INFO L193 MainTranslator]: Completed translation [2018-10-27 03:58:39,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39 WrapperNode [2018-10-27 03:58:39,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 03:58:39,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 03:58:39,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 03:58:39,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 03:58:39,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 03:58:39,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 03:58:39,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 03:58:39,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 03:58:39,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (1/1) ... [2018-10-27 03:58:39,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 03:58:39,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 03:58:39,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 03:58:39,972 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 03:58:39,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (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-27 03:58:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 03:58:40,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 03:58:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 03:58:40,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 03:58:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 03:58:40,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 03:58:41,909 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 03:58:41,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:58:41 BoogieIcfgContainer [2018-10-27 03:58:41,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 03:58:41,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 03:58:41,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 03:58:41,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 03:58:41,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:58:39" (1/3) ... [2018-10-27 03:58:41,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a301b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:58:41, skipping insertion in model container [2018-10-27 03:58:41,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:58:39" (2/3) ... [2018-10-27 03:58:41,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a301b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:58:41, skipping insertion in model container [2018-10-27 03:58:41,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:58:41" (3/3) ... [2018-10-27 03:58:41,919 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-27 03:58:41,928 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 03:58:41,936 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 03:58:41,954 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 03:58:41,990 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 03:58:41,990 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 03:58:41,990 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 03:58:41,990 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 03:58:41,990 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 03:58:41,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 03:58:41,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 03:58:41,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 03:58:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-10-27 03:58:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 03:58:42,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:42,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:58:42,030 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:42,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-10-27 03:58:42,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:42,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:42,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:42,209 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-27 03:58:42,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:42,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 03:58:42,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:42,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 03:58:42,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 03:58:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 03:58:42,234 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-10-27 03:58:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:42,273 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-10-27 03:58:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 03:58:42,274 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-27 03:58:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:42,288 INFO L225 Difference]: With dead ends: 222 [2018-10-27 03:58:42,288 INFO L226 Difference]: Without dead ends: 104 [2018-10-27 03:58:42,293 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-27 03:58:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-27 03:58:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-27 03:58:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-27 03:58:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-10-27 03:58:42,342 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-10-27 03:58:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:42,344 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-10-27 03:58:42,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 03:58:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-10-27 03:58:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 03:58:42,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:42,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:58:42,346 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:42,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-10-27 03:58:42,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:42,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:42,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:42,448 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-27 03:58:42,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:42,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:42,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:42,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:42,452 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-10-27 03:58:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:42,678 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-10-27 03:58:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:42,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-27 03:58:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:42,682 INFO L225 Difference]: With dead ends: 205 [2018-10-27 03:58:42,682 INFO L226 Difference]: Without dead ends: 107 [2018-10-27 03:58:42,684 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-27 03:58:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-27 03:58:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-27 03:58:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-27 03:58:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-10-27 03:58:42,696 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-10-27 03:58:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:42,697 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-10-27 03:58:42,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-10-27 03:58:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 03:58:42,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:42,699 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-27 03:58:42,699 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:42,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-10-27 03:58:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:42,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:42,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:42,900 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-27 03:58:42,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:42,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:42,901 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:42,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:42,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:42,902 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-10-27 03:58:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:43,313 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-10-27 03:58:43,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:43,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-27 03:58:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:43,316 INFO L225 Difference]: With dead ends: 209 [2018-10-27 03:58:43,316 INFO L226 Difference]: Without dead ends: 190 [2018-10-27 03:58:43,317 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-27 03:58:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-27 03:58:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-10-27 03:58:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-27 03:58:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-10-27 03:58:43,335 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-10-27 03:58:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:43,336 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-10-27 03:58:43,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-10-27 03:58:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 03:58:43,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:43,337 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-27 03:58:43,338 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:43,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-10-27 03:58:43,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:43,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:43,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:43,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:43,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:43,453 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-27 03:58:43,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:43,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:43,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:43,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:43,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:43,455 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-10-27 03:58:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:43,515 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-10-27 03:58:43,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:43,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 03:58:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:43,518 INFO L225 Difference]: With dead ends: 297 [2018-10-27 03:58:43,518 INFO L226 Difference]: Without dead ends: 128 [2018-10-27 03:58:43,521 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-27 03:58:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-27 03:58:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-27 03:58:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-27 03:58:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-10-27 03:58:43,532 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-10-27 03:58:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:43,533 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-10-27 03:58:43,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-10-27 03:58:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 03:58:43,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:43,535 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-27 03:58:43,535 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:43,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-10-27 03:58:43,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:43,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:43,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:43,648 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-27 03:58:43,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:43,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:43,649 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:43,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:43,651 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-10-27 03:58:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:43,886 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-10-27 03:58:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:43,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-27 03:58:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:43,888 INFO L225 Difference]: With dead ends: 230 [2018-10-27 03:58:43,888 INFO L226 Difference]: Without dead ends: 111 [2018-10-27 03:58:43,889 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-27 03:58:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-27 03:58:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-27 03:58:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-27 03:58:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-10-27 03:58:43,898 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-10-27 03:58:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:43,898 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-10-27 03:58:43,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-10-27 03:58:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 03:58:43,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:43,900 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-27 03:58:43,900 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:43,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-10-27 03:58:43,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:43,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:43,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:43,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:43,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:44,044 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-27 03:58:44,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:44,044 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:58:44,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-27 03:58:44,047 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-27 03:58:44,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:58:44,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:58:45,100 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:58:47,473 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 03:58:47,475 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-27 03:58:47,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:47,533 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 03:58:48,362 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 91.92% of their original sizes. [2018-10-27 03:58:48,363 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 03:58:49,162 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-10-27 03:58:49,162 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 03:58:49,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 03:58:49,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-27 03:58:49,164 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:49,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 03:58:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 03:58:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 03:58:49,165 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 13 states. [2018-10-27 03:59:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:00,007 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2018-10-27 03:59:00,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 03:59:00,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-10-27 03:59:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:00,008 INFO L225 Difference]: With dead ends: 225 [2018-10-27 03:59:00,008 INFO L226 Difference]: Without dead ends: 141 [2018-10-27 03:59:00,009 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-10-27 03:59:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-27 03:59:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-10-27 03:59:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-27 03:59:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2018-10-27 03:59:00,020 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 27 [2018-10-27 03:59:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:00,020 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2018-10-27 03:59:00,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 03:59:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2018-10-27 03:59:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 03:59:00,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:00,022 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-27 03:59:00,022 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:00,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:00,023 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-10-27 03:59:00,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:00,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:00,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:00,287 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-27 03:59:00,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:00,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:00,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-27 03:59:00,288 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-27 03:59:00,291 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:00,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:00,717 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:59:03,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:59:03,073 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-27 03:59:03,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:03,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:59:03,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:03,103 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-27 03:59:03,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:03,112 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:59:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:03,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:59:03,238 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-27 03:59:03,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:59:03,685 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2018-10-27 03:59:03,775 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-27 03:59:03,807 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 03:59:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-27 03:59:03,808 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:03,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 03:59:03,809 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand 3 states. [2018-10-27 03:59:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:03,861 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2018-10-27 03:59:03,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:03,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-27 03:59:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:03,863 INFO L225 Difference]: With dead ends: 138 [2018-10-27 03:59:03,863 INFO L226 Difference]: Without dead ends: 132 [2018-10-27 03:59:03,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 03:59:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-27 03:59:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-27 03:59:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-27 03:59:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2018-10-27 03:59:03,876 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 31 [2018-10-27 03:59:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:03,876 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2018-10-27 03:59:03,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2018-10-27 03:59:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 03:59:03,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:03,878 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-27 03:59:03,878 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:03,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-10-27 03:59:03,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:03,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:03,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:03,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:04,000 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-27 03:59:04,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:04,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:04,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:04,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:04,002 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand 3 states. [2018-10-27 03:59:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:04,187 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2018-10-27 03:59:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:04,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-27 03:59:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:04,189 INFO L225 Difference]: With dead ends: 218 [2018-10-27 03:59:04,189 INFO L226 Difference]: Without dead ends: 133 [2018-10-27 03:59:04,189 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-27 03:59:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-27 03:59:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-27 03:59:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-27 03:59:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2018-10-27 03:59:04,199 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 36 [2018-10-27 03:59:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:04,200 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2018-10-27 03:59:04,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2018-10-27 03:59:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 03:59:04,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:04,202 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-27 03:59:04,202 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:04,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-10-27 03:59:04,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:04,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:04,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:04,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:04,395 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-27 03:59:04,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:04,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:04,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-27 03:59:04,396 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-27 03:59:04,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:04,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:04,826 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:59:11,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:59:11,497 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-27 03:59:11,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:11,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:59:11,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:11,508 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-27 03:59:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:11,521 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:59:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:11,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:59:11,675 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-27 03:59:11,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:59:12,130 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2018-10-27 03:59:12,289 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-27 03:59:12,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:59:12,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-27 03:59:12,310 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:59:12,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 03:59:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 03:59:12,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 03:59:12,312 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand 5 states. [2018-10-27 03:59:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:12,828 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2018-10-27 03:59:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 03:59:12,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-27 03:59:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:12,833 INFO L225 Difference]: With dead ends: 194 [2018-10-27 03:59:12,833 INFO L226 Difference]: Without dead ends: 188 [2018-10-27 03:59:12,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 03:59:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-27 03:59:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2018-10-27 03:59:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-27 03:59:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 269 transitions. [2018-10-27 03:59:12,853 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 269 transitions. Word has length 37 [2018-10-27 03:59:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:12,853 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 269 transitions. [2018-10-27 03:59:12,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 03:59:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 269 transitions. [2018-10-27 03:59:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-27 03:59:12,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:12,856 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-27 03:59:12,860 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:12,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1280054677, now seen corresponding path program 1 times [2018-10-27 03:59:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:12,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:12,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:12,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:13,063 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-27 03:59:13,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:13,064 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:13,064 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-27 03:59:13,064 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-27 03:59:13,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:13,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:13,432 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:59:18,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:59:18,929 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-27 03:59:18,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:18,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:59:18,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:18,939 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-27 03:59:18,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:18,951 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:59:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:19,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:59:19,111 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-27 03:59:19,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:59:19,218 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-27 03:59:19,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:59:19,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2018-10-27 03:59:19,239 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:59:19,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 03:59:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 03:59:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-27 03:59:19,240 INFO L87 Difference]: Start difference. First operand 179 states and 269 transitions. Second operand 5 states. [2018-10-27 03:59:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:19,857 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2018-10-27 03:59:19,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 03:59:19,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-27 03:59:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:19,859 INFO L225 Difference]: With dead ends: 268 [2018-10-27 03:59:19,859 INFO L226 Difference]: Without dead ends: 254 [2018-10-27 03:59:19,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-27 03:59:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-27 03:59:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-10-27 03:59:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-27 03:59:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2018-10-27 03:59:19,872 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 38 [2018-10-27 03:59:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:19,872 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2018-10-27 03:59:19,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 03:59:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2018-10-27 03:59:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 03:59:19,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:19,874 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-27 03:59:19,874 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:19,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-10-27 03:59:19,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:19,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:19,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:20,085 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 03:59:20,235 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 03:59:20,406 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-27 03:59:20,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:20,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:20,407 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-27 03:59:20,407 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-27 03:59:20,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:20,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:20,749 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:59:28,724 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:59:28,725 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-27 03:59:28,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:28,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:59:28,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:28,731 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-27 03:59:28,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:28,743 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:59:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:28,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:59:28,951 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-27 03:59:28,967 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-27 03:59:28,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:59:29,808 WARN L179 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-27 03:59:29,873 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-27 03:59:29,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:59:29,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-10-27 03:59:29,894 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:59:29,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 03:59:29,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 03:59:29,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 03:59:29,896 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 6 states. [2018-10-27 03:59:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:30,510 INFO L93 Difference]: Finished difference Result 260 states and 381 transitions. [2018-10-27 03:59:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 03:59:30,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-27 03:59:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:30,516 INFO L225 Difference]: With dead ends: 260 [2018-10-27 03:59:30,516 INFO L226 Difference]: Without dead ends: 258 [2018-10-27 03:59:30,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 03:59:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-27 03:59:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-10-27 03:59:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-27 03:59:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2018-10-27 03:59:30,528 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 40 [2018-10-27 03:59:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:30,528 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2018-10-27 03:59:30,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 03:59:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2018-10-27 03:59:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 03:59:30,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:30,530 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-27 03:59:30,530 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:30,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:30,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-10-27 03:59:30,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:30,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:30,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:30,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:30,532 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:30,610 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-27 03:59:30,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:30,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:30,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:30,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:30,611 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 3 states. [2018-10-27 03:59:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:30,760 INFO L93 Difference]: Finished difference Result 440 states and 652 transitions. [2018-10-27 03:59:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:30,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-27 03:59:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:30,763 INFO L225 Difference]: With dead ends: 440 [2018-10-27 03:59:30,763 INFO L226 Difference]: Without dead ends: 235 [2018-10-27 03:59:30,763 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-27 03:59:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-27 03:59:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-27 03:59:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-27 03:59:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2018-10-27 03:59:30,775 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 41 [2018-10-27 03:59:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:30,775 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2018-10-27 03:59:30,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2018-10-27 03:59:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 03:59:30,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:30,777 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-27 03:59:30,777 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:30,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:30,777 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-10-27 03:59:30,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:30,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:30,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:30,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:30,855 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-27 03:59:30,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:59:30,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:59:30,855 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:59:30,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:59:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:59:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:59:30,856 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand 3 states. [2018-10-27 03:59:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:30,986 INFO L93 Difference]: Finished difference Result 318 states and 458 transitions. [2018-10-27 03:59:30,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:59:30,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-27 03:59:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:30,990 INFO L225 Difference]: With dead ends: 318 [2018-10-27 03:59:30,990 INFO L226 Difference]: Without dead ends: 150 [2018-10-27 03:59:30,991 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-27 03:59:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-27 03:59:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-27 03:59:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-27 03:59:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2018-10-27 03:59:30,999 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 50 [2018-10-27 03:59:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:30,999 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2018-10-27 03:59:30,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:59:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2018-10-27 03:59:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 03:59:31,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:31,000 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-27 03:59:31,000 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:31,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-10-27 03:59:31,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:31,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:31,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:31,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:31,174 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-27 03:59:31,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:31,175 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:31,175 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-27 03:59:31,175 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-27 03:59:31,177 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:31,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:31,503 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:59:41,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:59:41,919 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-27 03:59:41,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:41,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:59:41,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:41,925 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-27 03:59:41,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:41,934 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:59:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:41,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:59:42,082 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-27 03:59:42,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:59:42,257 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-10-27 03:59:42,350 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-27 03:59:42,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:59:42,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-10-27 03:59:42,371 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:59:42,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 03:59:42,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 03:59:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-27 03:59:42,373 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand 9 states. [2018-10-27 03:59:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:42,956 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2018-10-27 03:59:42,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 03:59:42,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-27 03:59:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:42,958 INFO L225 Difference]: With dead ends: 191 [2018-10-27 03:59:42,958 INFO L226 Difference]: Without dead ends: 187 [2018-10-27 03:59:42,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-27 03:59:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-27 03:59:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-10-27 03:59:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-27 03:59:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2018-10-27 03:59:42,969 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 51 [2018-10-27 03:59:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:42,969 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2018-10-27 03:59:42,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 03:59:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-10-27 03:59:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 03:59:42,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:42,970 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-27 03:59:42,970 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:42,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:42,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-10-27 03:59:42,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:42,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:42,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:43,216 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 03:59:43,376 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 03:59:43,592 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-27 03:59:43,636 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-27 03:59:43,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:43,637 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:43,637 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-27 03:59:43,637 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-27 03:59:43,640 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:43,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:43,957 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:02:38,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:02:38,946 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-27 04:02:38,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:38,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:02:38,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:38,958 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-27 04:02:38,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:38,970 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:39,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:39,234 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-27 04:02:39,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:39,572 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 25 [2018-10-27 04:02:40,126 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2018-10-27 04:02:40,154 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-27 04:02:40,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:40,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-27 04:02:40,193 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:40,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:02:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:02:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:02:40,195 INFO L87 Difference]: Start difference. First operand 184 states and 258 transitions. Second operand 9 states. [2018-10-27 04:02:40,969 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-27 04:02:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:41,156 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2018-10-27 04:02:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:02:41,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-27 04:02:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:41,159 INFO L225 Difference]: With dead ends: 188 [2018-10-27 04:02:41,160 INFO L226 Difference]: Without dead ends: 186 [2018-10-27 04:02:41,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:02:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-27 04:02:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-27 04:02:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-27 04:02:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2018-10-27 04:02:41,172 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 61 [2018-10-27 04:02:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:41,172 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2018-10-27 04:02:41,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:02:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2018-10-27 04:02:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-27 04:02:41,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:41,173 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-27 04:02:41,173 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:41,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-10-27 04:02:41,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:41,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:41,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:41,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:41,175 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:41,484 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 04:02:41,659 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 04:02:41,869 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 04:02:42,094 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 04:02:42,350 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 04:02:42,506 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-27 04:02:42,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:42,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:42,507 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-10-27 04:02:42,507 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-27 04:02:42,510 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:02:42,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:02:42,857 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-10-27 04:02:52,528 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-10-27 04:02:52,530 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-10-27 04:02:52,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:52,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:52,531 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-27 04:02:52,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:52,539 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:52,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:52,638 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 04:02:52,840 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:52,840 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 04:02:52,847 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 04:02:52,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:02:52 BoogieIcfgContainer [2018-10-27 04:02:52,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:02:52,849 INFO L168 Benchmark]: Toolchain (without parser) took 253687.50 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 263.8 MB. Max. memory is 7.1 GB. [2018-10-27 04:02:52,851 INFO L168 Benchmark]: CDTParser took 0.15 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-27 04:02:52,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.81 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-27 04:02:52,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:02:52,853 INFO L168 Benchmark]: Boogie Preprocessor took 100.79 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-27 04:02:52,854 INFO L168 Benchmark]: RCFGBuilder took 1938.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2018-10-27 04:02:52,854 INFO L168 Benchmark]: TraceAbstraction took 250936.77 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. [2018-10-27 04:02:52,860 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.15 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 663.81 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 42.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.79 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 1938.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250936.77 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 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, 250.8s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 15.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2265 SDtfs, 1372 SDslu, 3513 SDs, 0 SdLazy, 900 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s 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, 223.7s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.943293885601578 AbsIntWeakeningRatio, 1.7307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 662.5769230769231 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 55 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s 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