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_false-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 03:57:45,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 03:57:45,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 03:57:45,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 03:57:45,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 03:57:45,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 03:57:45,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 03:57:45,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 03:57:45,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 03:57:45,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 03:57:45,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 03:57:45,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 03:57:45,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 03:57:45,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 03:57:45,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 03:57:45,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 03:57:45,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 03:57:45,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 03:57:45,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 03:57:45,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 03:57:45,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 03:57:45,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 03:57:45,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 03:57:45,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 03:57:45,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 03:57:45,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 03:57:45,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 03:57:45,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 03:57:45,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 03:57:45,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 03:57:45,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 03:57:45,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 03:57:45,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 03:57:45,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 03:57:45,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 03:57:45,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 03:57:45,497 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:57:45,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 03:57:45,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 03:57:45,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 03:57:45,514 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 03:57:45,514 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 03:57:45,514 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 03:57:45,514 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 03:57:45,515 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 03:57:45,515 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 03:57:45,515 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 03:57:45,515 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 03:57:45,515 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 03:57:45,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 03:57:45,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 03:57:45,516 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 03:57:45,516 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 03:57:45,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 03:57:45,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 03:57:45,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 03:57:45,517 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 03:57:45,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 03:57:45,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 03:57:45,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 03:57:45,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 03:57:45,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 03:57:45,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 03:57:45,519 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 03:57:45,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 03:57:45,519 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 03:57:45,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 03:57:45,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 03:57:45,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 03:57:45,520 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 03:57:45,520 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 03:57:45,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 03:57:45,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 03:57:45,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 03:57:45,598 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 03:57:45,599 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 03:57:45,600 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-27 03:57:45,667 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4804dadf1/2b8bdc61aad441eeba31590ea2956322/FLAG143b36f5b [2018-10-27 03:57:46,235 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 03:57:46,241 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-27 03:57:46,253 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4804dadf1/2b8bdc61aad441eeba31590ea2956322/FLAG143b36f5b [2018-10-27 03:57:46,267 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4804dadf1/2b8bdc61aad441eeba31590ea2956322 [2018-10-27 03:57:46,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 03:57:46,280 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 03:57:46,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 03:57:46,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 03:57:46,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 03:57:46,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441f49ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46, skipping insertion in model container [2018-10-27 03:57:46,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 03:57:46,359 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 03:57:46,694 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 03:57:46,703 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 03:57:46,799 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 03:57:46,830 INFO L193 MainTranslator]: Completed translation [2018-10-27 03:57:46,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46 WrapperNode [2018-10-27 03:57:46,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 03:57:46,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 03:57:46,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 03:57:46,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 03:57:46,845 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:57:46" (1/1) ... [2018-10-27 03:57:46,861 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:57:46" (1/1) ... [2018-10-27 03:57:46,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 03:57:46,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 03:57:46,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 03:57:46,869 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 03:57:46,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (1/1) ... [2018-10-27 03:57:46,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 03:57:46,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 03:57:46,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 03:57:46,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 03:57:46,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (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:57:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 03:57:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 03:57:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 03:57:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 03:57:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 03:57:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 03:57:48,931 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 03:57:48,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:57:48 BoogieIcfgContainer [2018-10-27 03:57:48,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 03:57:48,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 03:57:48,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 03:57:48,939 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 03:57:48,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:57:46" (1/3) ... [2018-10-27 03:57:48,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7dbf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:57:48, skipping insertion in model container [2018-10-27 03:57:48,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:57:46" (2/3) ... [2018-10-27 03:57:48,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7dbf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:57:48, skipping insertion in model container [2018-10-27 03:57:48,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:57:48" (3/3) ... [2018-10-27 03:57:48,944 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_false-unreach-call_false-termination_true-no-overflow.c [2018-10-27 03:57:48,953 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 03:57:48,962 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 03:57:48,976 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 03:57:49,015 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 03:57:49,015 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 03:57:49,015 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 03:57:49,015 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 03:57:49,015 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 03:57:49,016 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 03:57:49,016 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 03:57:49,016 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 03:57:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-10-27 03:57:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 03:57:49,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:57:49,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:57:49,050 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:57:49,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash -662778961, now seen corresponding path program 1 times [2018-10-27 03:57:49,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:57:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:49,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:57:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:49,105 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:57:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:57:49,282 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:57:49,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:57:49,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:57:49,285 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:57:49,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:57:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:57:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:57:49,311 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2018-10-27 03:57:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:57:50,584 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2018-10-27 03:57:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:57:50,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-27 03:57:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:57:50,603 INFO L225 Difference]: With dead ends: 331 [2018-10-27 03:57:50,604 INFO L226 Difference]: Without dead ends: 206 [2018-10-27 03:57:50,610 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:57:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-27 03:57:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2018-10-27 03:57:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-27 03:57:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2018-10-27 03:57:50,717 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2018-10-27 03:57:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:57:50,718 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2018-10-27 03:57:50,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:57:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2018-10-27 03:57:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 03:57:50,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:57:50,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:57:50,725 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:57:50,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1058783719, now seen corresponding path program 1 times [2018-10-27 03:57:50,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:57:50,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:50,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:57:50,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:50,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:57:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:57:50,871 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:57:50,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:57:50,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:57:50,872 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:57:50,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:57:50,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:57:50,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:57:50,875 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2018-10-27 03:57:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:57:51,126 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2018-10-27 03:57:51,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:57:51,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-27 03:57:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:57:51,135 INFO L225 Difference]: With dead ends: 365 [2018-10-27 03:57:51,135 INFO L226 Difference]: Without dead ends: 189 [2018-10-27 03:57:51,138 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:57:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-27 03:57:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-27 03:57:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-27 03:57:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2018-10-27 03:57:51,167 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2018-10-27 03:57:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:57:51,173 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2018-10-27 03:57:51,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:57:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2018-10-27 03:57:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 03:57:51,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:57:51,176 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:57:51,177 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:57:51,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -426524154, now seen corresponding path program 1 times [2018-10-27 03:57:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:57:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:51,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:57:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:51,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:57:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:57:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:57:51,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:57:51,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:57:51,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:57:51,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:57:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:57:51,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:57:51,316 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 3 states. [2018-10-27 03:57:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:57:51,641 INFO L93 Difference]: Finished difference Result 290 states and 484 transitions. [2018-10-27 03:57:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:57:51,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 03:57:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:57:51,645 INFO L225 Difference]: With dead ends: 290 [2018-10-27 03:57:51,646 INFO L226 Difference]: Without dead ends: 274 [2018-10-27 03:57:51,646 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:57:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-27 03:57:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 259. [2018-10-27 03:57:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-27 03:57:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2018-10-27 03:57:51,673 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2018-10-27 03:57:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:57:51,674 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2018-10-27 03:57:51,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:57:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2018-10-27 03:57:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 03:57:51,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:57:51,675 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:57:51,676 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:57:51,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1881066880, now seen corresponding path program 1 times [2018-10-27 03:57:51,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:57:51,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:51,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:57:51,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:51,679 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:57:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:57:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:57:51,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:57:51,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:57:51,802 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:57:51,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:57:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:57:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:57:51,803 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2018-10-27 03:57:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:57:51,902 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2018-10-27 03:57:51,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:57:51,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-27 03:57:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:57:51,904 INFO L225 Difference]: With dead ends: 468 [2018-10-27 03:57:51,905 INFO L226 Difference]: Without dead ends: 216 [2018-10-27 03:57:51,909 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:57:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-27 03:57:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-10-27 03:57:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-27 03:57:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2018-10-27 03:57:51,935 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2018-10-27 03:57:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:57:51,936 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2018-10-27 03:57:51,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:57:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2018-10-27 03:57:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 03:57:51,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:57:51,938 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:57:51,938 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:57:51,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash 30525515, now seen corresponding path program 1 times [2018-10-27 03:57:51,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:57:51,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:51,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:57:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:51,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:57:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:57:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:57:52,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:57:52,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:57:52,088 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-27 03:57:52,090 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [54], [56], [526], [529], [530], [531] [2018-10-27 03:57:52,144 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:57:52,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:57:53,437 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:57:56,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:57:56,444 INFO L272 AbstractInterpreter]: Visited 21 different actions 45 times. Merged at 11 different actions 17 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 03:57:56,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:56,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:57:56,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:57:56,497 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:57:56,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:57:56,506 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:57:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:57:56,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:57:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 03:57:56,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:57:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 03:57:56,694 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 03:57:56,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-10-27 03:57:56,694 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:57:56,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:57:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:57:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 03:57:56,695 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 3 states. [2018-10-27 03:57:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:57:56,769 INFO L93 Difference]: Finished difference Result 389 states and 646 transitions. [2018-10-27 03:57:56,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:57:56,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-27 03:57:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:57:56,772 INFO L225 Difference]: With dead ends: 389 [2018-10-27 03:57:56,772 INFO L226 Difference]: Without dead ends: 182 [2018-10-27 03:57:56,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 03:57:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-27 03:57:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-27 03:57:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-27 03:57:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2018-10-27 03:57:56,781 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 28 [2018-10-27 03:57:56,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:57:56,781 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2018-10-27 03:57:56,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:57:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2018-10-27 03:57:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 03:57:56,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:57:56,783 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 03:57:56,783 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:57:56,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1381236108, now seen corresponding path program 1 times [2018-10-27 03:57:56,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:57:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:57:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:57:56,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:57:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:57:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:57:56,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:57:56,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:57:56,876 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-27 03:57:56,876 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [239], [242], [245], [526], [529], [530], [531] [2018-10-27 03:57:56,879 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:57:56,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:57:57,406 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:57:59,799 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 03:57:59,799 INFO L272 AbstractInterpreter]: Visited 25 different actions 55 times. Merged at 16 different actions 22 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-27 03:57:59,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:57:59,834 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 03:58:00,659 INFO L227 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 91.12% of their original sizes. [2018-10-27 03:58:00,659 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 03:58:01,721 INFO L415 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2018-10-27 03:58:01,722 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 03:58:01,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 03:58:01,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-27 03:58:01,723 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:01,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 03:58:01,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 03:58:01,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-10-27 03:58:01,724 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 14 states. [2018-10-27 03:58:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:13,612 INFO L93 Difference]: Finished difference Result 375 states and 610 transitions. [2018-10-27 03:58:13,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 03:58:13,612 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-10-27 03:58:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:13,614 INFO L225 Difference]: With dead ends: 375 [2018-10-27 03:58:13,614 INFO L226 Difference]: Without dead ends: 220 [2018-10-27 03:58:13,615 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-10-27 03:58:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-27 03:58:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-27 03:58:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-27 03:58:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 338 transitions. [2018-10-27 03:58:13,627 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 338 transitions. Word has length 30 [2018-10-27 03:58:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:13,628 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 338 transitions. [2018-10-27 03:58:13,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 03:58:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 338 transitions. [2018-10-27 03:58:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 03:58:13,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:13,629 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 03:58:13,633 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:13,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1339641340, now seen corresponding path program 1 times [2018-10-27 03:58:13,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:13,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 03:58:13,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:13,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:13,749 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:13,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:13,750 INFO L87 Difference]: Start difference. First operand 217 states and 338 transitions. Second operand 3 states. [2018-10-27 03:58:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:14,208 INFO L93 Difference]: Finished difference Result 391 states and 620 transitions. [2018-10-27 03:58:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:14,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-27 03:58:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:14,210 INFO L225 Difference]: With dead ends: 391 [2018-10-27 03:58:14,210 INFO L226 Difference]: Without dead ends: 223 [2018-10-27 03:58:14,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-27 03:58:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-27 03:58:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 03:58:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2018-10-27 03:58:14,223 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 341 transitions. Word has length 40 [2018-10-27 03:58:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:14,223 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 341 transitions. [2018-10-27 03:58:14,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 341 transitions. [2018-10-27 03:58:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 03:58:14,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:14,225 INFO L375 BasicCegarLoop]: trace histogram [4, 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:58:14,225 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:14,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699710, now seen corresponding path program 1 times [2018-10-27 03:58:14,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:14,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:14,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:14,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:14,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 03:58:14,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:14,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:14,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:14,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:14,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:14,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:14,313 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. Second operand 3 states. [2018-10-27 03:58:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:14,595 INFO L93 Difference]: Finished difference Result 395 states and 619 transitions. [2018-10-27 03:58:14,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:14,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-27 03:58:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:14,597 INFO L225 Difference]: With dead ends: 395 [2018-10-27 03:58:14,597 INFO L226 Difference]: Without dead ends: 223 [2018-10-27 03:58:14,598 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:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-27 03:58:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-27 03:58:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 03:58:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 339 transitions. [2018-10-27 03:58:14,607 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 339 transitions. Word has length 40 [2018-10-27 03:58:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:14,608 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 339 transitions. [2018-10-27 03:58:14,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 339 transitions. [2018-10-27 03:58:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 03:58:14,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:14,609 INFO L375 BasicCegarLoop]: trace histogram [4, 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:58:14,610 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:14,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 937434793, now seen corresponding path program 1 times [2018-10-27 03:58:14,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:14,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:15,156 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-27 03:58:15,775 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-10-27 03:58:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 03:58:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:15,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:58:15,781 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-27 03:58:15,781 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [335], [338], [341], [526], [529], [530], [531] [2018-10-27 03:58:15,784 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:58:15,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:58:16,254 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:58:24,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:58:24,835 INFO L272 AbstractInterpreter]: Visited 31 different actions 145 times. Merged at 24 different actions 96 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 41 variables. [2018-10-27 03:58:24,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:24,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:58:24,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:24,843 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:58:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:24,852 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:58:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:24,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:58:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 03:58:25,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:58:25,782 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 6 [2018-10-27 03:58:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 03:58:26,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:58:26,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-27 03:58:26,037 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:58:26,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 03:58:26,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 03:58:26,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 03:58:26,038 INFO L87 Difference]: Start difference. First operand 221 states and 339 transitions. Second operand 7 states. [2018-10-27 03:58:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:27,554 INFO L93 Difference]: Finished difference Result 474 states and 733 transitions. [2018-10-27 03:58:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 03:58:27,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-27 03:58:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:27,558 INFO L225 Difference]: With dead ends: 474 [2018-10-27 03:58:27,558 INFO L226 Difference]: Without dead ends: 292 [2018-10-27 03:58:27,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-27 03:58:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-27 03:58:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 272. [2018-10-27 03:58:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-27 03:58:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 419 transitions. [2018-10-27 03:58:27,576 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 419 transitions. Word has length 41 [2018-10-27 03:58:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:27,576 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 419 transitions. [2018-10-27 03:58:27,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 03:58:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 419 transitions. [2018-10-27 03:58:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 03:58:27,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:27,578 INFO L375 BasicCegarLoop]: trace histogram [4, 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:58:27,578 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:27,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash -992845957, now seen corresponding path program 1 times [2018-10-27 03:58:27,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:27,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:27,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:27,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:27,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 03:58:27,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:27,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:58:27,732 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-27 03:58:27,733 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [350], [353], [356], [526], [529], [530], [531] [2018-10-27 03:58:27,735 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:58:27,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:58:28,124 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:58:34,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:58:34,767 INFO L272 AbstractInterpreter]: Visited 32 different actions 147 times. Merged at 25 different actions 95 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 42 variables. [2018-10-27 03:58:34,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:34,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:58:34,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:34,775 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:58:34,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:34,785 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:58:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:34,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:58:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 03:58:34,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:58:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 03:58:34,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:58:34,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-10-27 03:58:34,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:58:34,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 03:58:34,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 03:58:34,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 03:58:34,928 INFO L87 Difference]: Start difference. First operand 272 states and 419 transitions. Second operand 4 states. [2018-10-27 03:58:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:35,404 INFO L93 Difference]: Finished difference Result 446 states and 695 transitions. [2018-10-27 03:58:35,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 03:58:35,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-10-27 03:58:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:35,408 INFO L225 Difference]: With dead ends: 446 [2018-10-27 03:58:35,408 INFO L226 Difference]: Without dead ends: 424 [2018-10-27 03:58:35,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 03:58:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-10-27 03:58:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2018-10-27 03:58:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-27 03:58:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 636 transitions. [2018-10-27 03:58:35,429 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 636 transitions. Word has length 42 [2018-10-27 03:58:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:35,429 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 636 transitions. [2018-10-27 03:58:35,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 03:58:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 636 transitions. [2018-10-27 03:58:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 03:58:35,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:35,430 INFO L375 BasicCegarLoop]: trace histogram [4, 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:58:35,430 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:35,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash -275920596, now seen corresponding path program 1 times [2018-10-27 03:58:35,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:35,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:35,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:35,685 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 03:58:35,849 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 03:58:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:58:35,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:35,901 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:58:35,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-27 03:58:35,901 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [386], [526], [529], [530], [531] [2018-10-27 03:58:35,903 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:58:35,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:58:36,271 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:58:43,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:58:43,714 INFO L272 AbstractInterpreter]: Visited 34 different actions 157 times. Merged at 27 different actions 105 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 44 variables. [2018-10-27 03:58:43,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:43,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:58:43,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:43,724 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:58:43,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:43,732 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:58:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:43,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:58:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:58:43,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:58:44,338 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2018-10-27 03:58:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:58:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:58:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-27 03:58:44,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:58:44,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 03:58:44,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 03:58:44,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-27 03:58:44,552 INFO L87 Difference]: Start difference. First operand 422 states and 636 transitions. Second operand 5 states. [2018-10-27 03:58:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:44,999 INFO L93 Difference]: Finished difference Result 431 states and 643 transitions. [2018-10-27 03:58:45,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 03:58:45,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-27 03:58:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:45,005 INFO L225 Difference]: With dead ends: 431 [2018-10-27 03:58:45,005 INFO L226 Difference]: Without dead ends: 429 [2018-10-27 03:58:45,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-27 03:58:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-27 03:58:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 423. [2018-10-27 03:58:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-27 03:58:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 637 transitions. [2018-10-27 03:58:45,023 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 637 transitions. Word has length 44 [2018-10-27 03:58:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:45,023 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 637 transitions. [2018-10-27 03:58:45,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 03:58:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 637 transitions. [2018-10-27 03:58:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 03:58:45,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:45,024 INFO L375 BasicCegarLoop]: trace histogram [4, 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:58:45,024 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:45,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash 161633879, now seen corresponding path program 1 times [2018-10-27 03:58:45,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:45,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:45,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:45,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 03:58:45,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:45,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:45,131 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:45,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:45,132 INFO L87 Difference]: Start difference. First operand 423 states and 637 transitions. Second operand 3 states. [2018-10-27 03:58:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:45,264 INFO L93 Difference]: Finished difference Result 795 states and 1193 transitions. [2018-10-27 03:58:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:45,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-27 03:58:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:45,267 INFO L225 Difference]: With dead ends: 795 [2018-10-27 03:58:45,268 INFO L226 Difference]: Without dead ends: 421 [2018-10-27 03:58:45,269 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:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-27 03:58:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 399. [2018-10-27 03:58:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-27 03:58:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 584 transitions. [2018-10-27 03:58:45,290 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 584 transitions. Word has length 45 [2018-10-27 03:58:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:45,290 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 584 transitions. [2018-10-27 03:58:45,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 584 transitions. [2018-10-27 03:58:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 03:58:45,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:45,291 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 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, 1] [2018-10-27 03:58:45,292 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:45,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1614817955, now seen corresponding path program 1 times [2018-10-27 03:58:45,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:45,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:45,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:45,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:45,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 03:58:45,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 03:58:45,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 03:58:45,380 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 03:58:45,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 03:58:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 03:58:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 03:58:45,381 INFO L87 Difference]: Start difference. First operand 399 states and 584 transitions. Second operand 3 states. [2018-10-27 03:58:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:45,664 INFO L93 Difference]: Finished difference Result 555 states and 812 transitions. [2018-10-27 03:58:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 03:58:45,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-10-27 03:58:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:45,668 INFO L225 Difference]: With dead ends: 555 [2018-10-27 03:58:45,668 INFO L226 Difference]: Without dead ends: 225 [2018-10-27 03:58:45,669 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:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-27 03:58:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-10-27 03:58:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-27 03:58:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2018-10-27 03:58:45,681 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 316 transitions. Word has length 55 [2018-10-27 03:58:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:45,681 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 316 transitions. [2018-10-27 03:58:45,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 03:58:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2018-10-27 03:58:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 03:58:45,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:45,682 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:58:45,682 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:45,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1860919614, now seen corresponding path program 1 times [2018-10-27 03:58:45,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:45,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:45,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 03:58:45,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:45,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:58:45,925 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-27 03:58:45,925 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [526], [529], [530], [531] [2018-10-27 03:58:45,927 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:58:45,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:58:46,507 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:58:57,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:58:57,013 INFO L272 AbstractInterpreter]: Visited 41 different actions 233 times. Merged at 33 different actions 152 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2018-10-27 03:58:57,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:57,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:58:57,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:57,022 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:58:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:57,031 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:58:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:57,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:58:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 03:58:57,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:58:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 03:58:57,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:58:57,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-10-27 03:58:57,195 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:58:57,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 03:58:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 03:58:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 03:58:57,196 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. Second operand 5 states. [2018-10-27 03:58:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:58:57,386 INFO L93 Difference]: Finished difference Result 597 states and 858 transitions. [2018-10-27 03:58:57,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 03:58:57,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-10-27 03:58:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:58:57,390 INFO L225 Difference]: With dead ends: 597 [2018-10-27 03:58:57,390 INFO L226 Difference]: Without dead ends: 442 [2018-10-27 03:58:57,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 03:58:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-10-27 03:58:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 326. [2018-10-27 03:58:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-27 03:58:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 472 transitions. [2018-10-27 03:58:57,407 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 472 transitions. Word has length 56 [2018-10-27 03:58:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:58:57,408 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 472 transitions. [2018-10-27 03:58:57,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 03:58:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 472 transitions. [2018-10-27 03:58:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-27 03:58:57,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:58:57,409 INFO L375 BasicCegarLoop]: trace histogram [5, 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:58:57,409 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:58:57,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:58:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2119085052, now seen corresponding path program 1 times [2018-10-27 03:58:57,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:58:57,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:57,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:58:57,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:58:57,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:58:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:58:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 03:58:57,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:58:57,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:58:57,732 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-27 03:58:57,733 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [446], [449], [452], [526], [529], [530], [531] [2018-10-27 03:58:57,735 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:58:57,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:58:58,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:59:09,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:59:09,423 INFO L272 AbstractInterpreter]: Visited 40 different actions 222 times. Merged at 33 different actions 152 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:09,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:09,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:59:09,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:09,432 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 03:59:09,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:09,449 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:59:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:09,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:59:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 03:59:09,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:59:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 03:59:09,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:59:09,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2018-10-27 03:59:09,590 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:59:09,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 03:59:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 03:59:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 03:59:09,591 INFO L87 Difference]: Start difference. First operand 326 states and 472 transitions. Second operand 5 states. [2018-10-27 03:59:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:09,759 INFO L93 Difference]: Finished difference Result 373 states and 538 transitions. [2018-10-27 03:59:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 03:59:09,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-10-27 03:59:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:09,762 INFO L225 Difference]: With dead ends: 373 [2018-10-27 03:59:09,762 INFO L226 Difference]: Without dead ends: 367 [2018-10-27 03:59:09,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 03:59:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-27 03:59:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2018-10-27 03:59:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-27 03:59:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 526 transitions. [2018-10-27 03:59:09,779 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 526 transitions. Word has length 56 [2018-10-27 03:59:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:09,779 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 526 transitions. [2018-10-27 03:59:09,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 03:59:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 526 transitions. [2018-10-27 03:59:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 03:59:09,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:09,780 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 03:59:09,780 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:09,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 807144158, now seen corresponding path program 1 times [2018-10-27 03:59:09,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:09,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:09,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:09,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:10,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:10,664 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:10,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-27 03:59:10,665 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [512], [526], [529], [530], [531] [2018-10-27 03:59:10,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:10,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:11,020 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 03:59:22,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 03:59:22,639 INFO L272 AbstractInterpreter]: Visited 44 different actions 243 times. Merged at 37 different actions 170 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 50 variables. [2018-10-27 03:59:22,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:22,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 03:59:22,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:22,650 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 03:59:22,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:22,659 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 03:59:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:22,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 03:59:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:22,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 03:59:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:23,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 03:59:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2018-10-27 03:59:23,085 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 03:59:23,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 03:59:23,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 03:59:23,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-27 03:59:23,086 INFO L87 Difference]: Start difference. First operand 364 states and 526 transitions. Second operand 10 states. [2018-10-27 03:59:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 03:59:23,337 INFO L93 Difference]: Finished difference Result 367 states and 528 transitions. [2018-10-27 03:59:23,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 03:59:23,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-10-27 03:59:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 03:59:23,340 INFO L225 Difference]: With dead ends: 367 [2018-10-27 03:59:23,340 INFO L226 Difference]: Without dead ends: 365 [2018-10-27 03:59:23,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-10-27 03:59:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-27 03:59:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 364. [2018-10-27 03:59:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-27 03:59:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 525 transitions. [2018-10-27 03:59:23,357 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 525 transitions. Word has length 60 [2018-10-27 03:59:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 03:59:23,357 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 525 transitions. [2018-10-27 03:59:23,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 03:59:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 525 transitions. [2018-10-27 03:59:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 03:59:23,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 03:59:23,358 INFO L375 BasicCegarLoop]: trace histogram [6, 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:23,359 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 03:59:23,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 03:59:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash -743255307, now seen corresponding path program 1 times [2018-10-27 03:59:23,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 03:59:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:23,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 03:59:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 03:59:23,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 03:59:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 03:59:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 03:59:23,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 03:59:23,700 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 03:59:23,700 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-10-27 03:59:23,700 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [54], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-27 03:59:23,702 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 03:59:23,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 03:59:24,055 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:00:10,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:00:10,266 INFO L272 AbstractInterpreter]: Visited 45 different actions 781 times. Merged at 38 different actions 630 times. Widened at 5 different actions 41 times. Found 105 fixpoints after 14 different actions. Largest state had 50 variables. [2018-10-27 04:00:10,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:10,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:00:10,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:10,277 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:00:10,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:10,287 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:00:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:10,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:00:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:00:10,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:00:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:00:10,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:00:10,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-27 04:00:10,989 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:00:10,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:00:10,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:00:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:00:10,991 INFO L87 Difference]: Start difference. First operand 364 states and 525 transitions. Second operand 9 states. [2018-10-27 04:00:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:00:11,356 INFO L93 Difference]: Finished difference Result 368 states and 529 transitions. [2018-10-27 04:00:11,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:00:11,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-10-27 04:00:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:00:11,360 INFO L225 Difference]: With dead ends: 368 [2018-10-27 04:00:11,360 INFO L226 Difference]: Without dead ends: 366 [2018-10-27 04:00:11,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:00:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-27 04:00:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-10-27 04:00:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-27 04:00:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 526 transitions. [2018-10-27 04:00:11,377 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 526 transitions. Word has length 67 [2018-10-27 04:00:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:00:11,378 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 526 transitions. [2018-10-27 04:00:11,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:00:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 526 transitions. [2018-10-27 04:00:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:00:11,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:00:11,379 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 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, 1] [2018-10-27 04:00:11,379 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:00:11,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:00:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1746386041, now seen corresponding path program 1 times [2018-10-27 04:00:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:00:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:00:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:00:11,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:00:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:00:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:00:11,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:00:11,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:00:11,755 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-10-27 04:00:11,755 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [260], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-27 04:00:11,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:00:11,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:00:12,162 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:01:06,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:01:06,013 INFO L272 AbstractInterpreter]: Visited 46 different actions 945 times. Merged at 39 different actions 734 times. Widened at 5 different actions 46 times. Found 128 fixpoints after 16 different actions. Largest state had 50 variables. [2018-10-27 04:01:06,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:06,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:01:06,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:06,019 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:01:06,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:06,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:01:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:06,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:01:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:01:06,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:01:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:01:06,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:01:06,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-10-27 04:01:06,261 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:01:06,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:01:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:01:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:01:06,262 INFO L87 Difference]: Start difference. First operand 365 states and 526 transitions. Second operand 6 states. [2018-10-27 04:01:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:01:06,597 INFO L93 Difference]: Finished difference Result 825 states and 1192 transitions. [2018-10-27 04:01:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:01:06,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-10-27 04:01:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:01:06,603 INFO L225 Difference]: With dead ends: 825 [2018-10-27 04:01:06,603 INFO L226 Difference]: Without dead ends: 568 [2018-10-27 04:01:06,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:01:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-27 04:01:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 446. [2018-10-27 04:01:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-27 04:01:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 649 transitions. [2018-10-27 04:01:06,625 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 649 transitions. Word has length 77 [2018-10-27 04:01:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:01:06,626 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 649 transitions. [2018-10-27 04:01:06,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:01:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 649 transitions. [2018-10-27 04:01:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:01:06,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:06,627 INFO L375 BasicCegarLoop]: trace histogram [7, 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:01:06,627 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:06,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2139413051, now seen corresponding path program 1 times [2018-10-27 04:01:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:06,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:06,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:06,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:06,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:01:06,878 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-10-27 04:01:06,878 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [260], [262], [329], [332], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-27 04:01:06,880 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:01:06,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:01:07,263 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:01:49,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:01:49,712 INFO L272 AbstractInterpreter]: Visited 45 different actions 785 times. Merged at 38 different actions 632 times. Widened at 5 different actions 42 times. Found 104 fixpoints after 13 different actions. Largest state had 50 variables. [2018-10-27 04:01:49,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:49,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:01:49,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:49,721 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:01:49,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:49,730 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:01:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:49,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:01:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 04:01:50,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:01:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 04:01:50,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:01:50,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2018-10-27 04:01:50,151 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:01:50,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:01:50,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:01:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:01:50,152 INFO L87 Difference]: Start difference. First operand 446 states and 649 transitions. Second operand 12 states. [2018-10-27 04:01:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:01:50,477 INFO L93 Difference]: Finished difference Result 472 states and 685 transitions. [2018-10-27 04:01:50,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:01:50,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-10-27 04:01:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:01:50,480 INFO L225 Difference]: With dead ends: 472 [2018-10-27 04:01:50,480 INFO L226 Difference]: Without dead ends: 468 [2018-10-27 04:01:50,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:01:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-27 04:01:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2018-10-27 04:01:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-10-27 04:01:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 679 transitions. [2018-10-27 04:01:50,499 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 679 transitions. Word has length 77 [2018-10-27 04:01:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:01:50,500 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 679 transitions. [2018-10-27 04:01:50,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:01:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 679 transitions. [2018-10-27 04:01:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 04:01:50,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:50,501 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:01:50,501 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:50,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1314627048, now seen corresponding path program 1 times [2018-10-27 04:01:50,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:50,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:50,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:50,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 26 proven. 99 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 04:01:50,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:50,810 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:01:50,810 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-10-27 04:01:50,810 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [20], [24], [27], [30], [35], [42], [45], [48], [51], [56], [138], [233], [236], [251], [254], [257], [262], [329], [332], [335], [338], [341], [347], [362], [377], [380], [383], [388], [425], [428], [443], [458], [473], [488], [503], [506], [509], [514], [526], [529], [530], [531] [2018-10-27 04:01:50,812 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:01:50,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:01:51,200 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-10-27 04:01:53,144 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-10-27 04:01:53,145 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-10-27 04:01:53,146 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:01:53,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:01:53,146 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:01:53,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:53,154 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:01:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:53,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:01:53,239 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 04:01:53,440 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:01:53,440 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 04:01:53,446 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 04:01:53,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:01:53 BoogieIcfgContainer [2018-10-27 04:01:53,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:01:53,447 INFO L168 Benchmark]: Toolchain (without parser) took 247167.98 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 1.8 GB in the end (delta: -355.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-27 04:01:53,448 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:01:53,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.55 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:01:53,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.42 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:01:53,449 INFO L168 Benchmark]: Boogie Preprocessor took 78.49 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:01:53,450 INFO L168 Benchmark]: RCFGBuilder took 1984.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.7 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2018-10-27 04:01:53,451 INFO L168 Benchmark]: TraceAbstraction took 244512.96 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 386.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-27 04:01:53,455 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 550.55 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 35.42 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 78.49 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 1984.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.7 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244512.96 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 386.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 88 with TraceHistMax 8,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, 115 locations, 1 error locations. TIMEOUT Result, 244.4s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3077 SDtfs, 2601 SDslu, 6113 SDs, 0 SdLazy, 1853 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1219 GetRequests, 1093 SyntacticMatches, 19 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 212.0s AbstIntTime, 12 AbstIntIterations, 1 AbstIntStrong, 0.949160035366932 AbsIntWeakeningRatio, 1.5517241379310345 AbsIntAvgWeakeningVarsNumRemoved, 593.7931034482758 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 345 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1378 NumberOfCodeBlocks, 1378 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1887 ConstructedInterpolants, 52 QuantifiedInterpolants, 592757 SizeOfPredicates, 28 NumberOfNonLiveVariables, 3526 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 39 InterpolantComputations, 10 PerfectInterpolantSequences, 755/1548 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown