java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:09:43,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:09:43,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:09:43,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:09:43,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:09:43,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:09:43,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:09:43,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:09:43,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:09:43,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:09:43,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:09:43,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:09:43,964 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:09:43,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:09:43,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:09:43,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:09:43,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:09:43,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:09:43,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:09:43,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:09:43,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:09:43,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:09:43,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:09:43,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:09:43,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:09:43,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:09:43,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:09:43,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:09:43,995 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:09:43,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:09:43,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:09:43,997 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:09:43,998 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:09:43,998 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:09:44,000 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:09:44,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:09:44,001 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:09:44,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:09:44,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:09:44,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:09:44,031 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:09:44,031 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:09:44,031 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:09:44,032 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:09:44,032 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:09:44,032 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:09:44,032 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:09:44,032 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:09:44,033 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:09:44,033 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:09:44,033 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:09:44,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:09:44,034 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:09:44,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:09:44,034 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:09:44,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:09:44,035 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:09:44,035 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:09:44,035 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:09:44,035 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:09:44,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:09:44,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:09:44,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:09:44,036 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:09:44,036 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:09:44,036 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:09:44,037 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:09:44,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:09:44,037 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:09:44,037 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:09:44,037 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:09:44,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:09:44,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:09:44,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:09:44,116 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:09:44,116 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:09:44,117 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-07 05:09:44,183 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80e6b024/bc320b377a7247ea9022505c4d76985c/FLAG1adf72e37 [2018-11-07 05:09:44,587 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:09:44,588 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-07 05:09:44,595 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80e6b024/bc320b377a7247ea9022505c4d76985c/FLAG1adf72e37 [2018-11-07 05:09:44,611 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80e6b024/bc320b377a7247ea9022505c4d76985c [2018-11-07 05:09:44,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:09:44,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:09:44,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:09:44,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:09:44,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:09:44,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e77fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44, skipping insertion in model container [2018-11-07 05:09:44,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:09:44,665 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:09:44,901 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:09:44,905 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:09:44,924 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:09:44,938 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:09:44,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44 WrapperNode [2018-11-07 05:09:44,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:09:44,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:09:44,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:09:44,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:09:44,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:09:44,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:09:44,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:09:44,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:09:44,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... [2018-11-07 05:09:44,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:09:44,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:09:44,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:09:44,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:09:44,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:09:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:09:45,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:09:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-11-07 05:09:45,114 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-11-07 05:09:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:09:45,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:09:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:09:45,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:09:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:09:45,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:09:45,488 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:09:45,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:09:45 BoogieIcfgContainer [2018-11-07 05:09:45,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:09:45,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:09:45,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:09:45,493 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:09:45,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:09:44" (1/3) ... [2018-11-07 05:09:45,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2cd974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:09:45, skipping insertion in model container [2018-11-07 05:09:45,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:44" (2/3) ... [2018-11-07 05:09:45,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2cd974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:09:45, skipping insertion in model container [2018-11-07 05:09:45,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:09:45" (3/3) ... [2018-11-07 05:09:45,497 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-11-07 05:09:45,507 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:09:45,519 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:09:45,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:09:45,570 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:09:45,571 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:09:45,571 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:09:45,571 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:09:45,571 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:09:45,571 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:09:45,571 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:09:45,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:09:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-07 05:09:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 05:09:45,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:45,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:45,600 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:45,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1030098894, now seen corresponding path program 1 times [2018-11-07 05:09:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:45,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:45,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:45,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:09:45,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:09:45,723 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:45,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:09:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:09:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:09:45,743 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-07 05:09:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:45,765 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-11-07 05:09:45,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:09:45,767 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-07 05:09:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:45,776 INFO L225 Difference]: With dead ends: 44 [2018-11-07 05:09:45,776 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 05:09:45,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:09:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 05:09:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 05:09:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 05:09:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-07 05:09:45,816 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-11-07 05:09:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:45,817 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-07 05:09:45,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:09:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-07 05:09:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 05:09:45,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:45,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:45,819 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:45,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1176183033, now seen corresponding path program 1 times [2018-11-07 05:09:45,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:45,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:45,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:45,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:45,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:45,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:09:45,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:09:45,904 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:45,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:09:45,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:09:45,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:09:45,906 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-07 05:09:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:46,009 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-07 05:09:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:09:46,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-07 05:09:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:46,011 INFO L225 Difference]: With dead ends: 46 [2018-11-07 05:09:46,011 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 05:09:46,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:09:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 05:09:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-07 05:09:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 05:09:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-07 05:09:46,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2018-11-07 05:09:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:46,021 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-07 05:09:46,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:09:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-07 05:09:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 05:09:46,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:46,022 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:46,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:46,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1045124110, now seen corresponding path program 1 times [2018-11-07 05:09:46,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:46,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:46,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:46,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:46,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:46,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:46,102 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 05:09:46,104 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 05:09:46,159 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:46,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:46,493 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:09:46,494 INFO L272 AbstractInterpreter]: Visited 18 different actions 66 times. Merged at 4 different actions 38 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-07 05:09:46,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:46,539 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:09:46,688 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 62.04% of their original sizes. [2018-11-07 05:09:46,689 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:09:47,014 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-11-07 05:09:47,015 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:09:47,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:47,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-07 05:09:47,016 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:47,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:09:47,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:09:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:09:47,018 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-07 05:09:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:47,583 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-07 05:09:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:09:47,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 05:09:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:47,586 INFO L225 Difference]: With dead ends: 58 [2018-11-07 05:09:47,586 INFO L226 Difference]: Without dead ends: 41 [2018-11-07 05:09:47,587 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:09:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-07 05:09:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-07 05:09:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 05:09:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-07 05:09:47,599 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2018-11-07 05:09:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:47,600 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-07 05:09:47,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:09:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-07 05:09:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 05:09:47,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:47,601 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:47,601 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:47,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1102382412, now seen corresponding path program 1 times [2018-11-07 05:09:47,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:47,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:47,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:47,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:47,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:47,724 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:47,724 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 05:09:47,725 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 05:09:47,729 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:47,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:47,839 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:09:47,840 INFO L272 AbstractInterpreter]: Visited 22 different actions 60 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-07 05:09:47,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:47,860 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:09:47,964 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 60.23% of their original sizes. [2018-11-07 05:09:47,965 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:09:48,432 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-11-07 05:09:48,432 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:09:48,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:48,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-07 05:09:48,433 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:48,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:09:48,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:09:48,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:09:48,434 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 10 states. [2018-11-07 05:09:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:49,350 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-07 05:09:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:09:49,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-07 05:09:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:49,352 INFO L225 Difference]: With dead ends: 66 [2018-11-07 05:09:49,352 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 05:09:49,353 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:09:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 05:09:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-11-07 05:09:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 05:09:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-07 05:09:49,374 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 24 [2018-11-07 05:09:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:49,374 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-07 05:09:49,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:09:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-07 05:09:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 05:09:49,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:49,376 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:49,377 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:49,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1438151120, now seen corresponding path program 1 times [2018-11-07 05:09:49,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:49,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:49,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:49,442 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:49,442 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 05:09:49,443 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 05:09:49,445 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:49,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:49,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:09:49,467 INFO L272 AbstractInterpreter]: Visited 17 different actions 21 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-07 05:09:49,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:49,473 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:09:49,511 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 67.65% of their original sizes. [2018-11-07 05:09:49,512 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:09:49,784 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-11-07 05:09:49,785 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:09:49,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:49,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-07 05:09:49,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:49,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:09:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:09:49,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:09:49,787 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-11-07 05:09:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:50,152 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-11-07 05:09:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:09:50,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 05:09:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:50,156 INFO L225 Difference]: With dead ends: 71 [2018-11-07 05:09:50,156 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 05:09:50,157 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:09:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 05:09:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-07 05:09:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 05:09:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-07 05:09:50,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2018-11-07 05:09:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:50,185 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-07 05:09:50,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:09:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-07 05:09:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 05:09:50,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:50,187 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] [2018-11-07 05:09:50,191 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:50,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:50,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1472263337, now seen corresponding path program 1 times [2018-11-07 05:09:50,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:50,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:50,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:50,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:50,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:50,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:50,418 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 05:09:50,418 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 05:09:50,421 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:50,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:50,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:09:50,524 INFO L272 AbstractInterpreter]: Visited 23 different actions 95 times. Merged at 6 different actions 51 times. Widened at 1 different actions 7 times. Found 13 fixpoints after 4 different actions. Largest state had 8 variables. [2018-11-07 05:09:50,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:50,547 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:09:50,598 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-11-07 05:09:50,599 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:09:50,961 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-11-07 05:09:50,962 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:09:50,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:50,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-07 05:09:50,963 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:50,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:09:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:09:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:09:50,964 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 12 states. [2018-11-07 05:09:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:51,913 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-07 05:09:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:09:51,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-07 05:09:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:51,915 INFO L225 Difference]: With dead ends: 78 [2018-11-07 05:09:51,915 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 05:09:51,916 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:09:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 05:09:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-11-07 05:09:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 05:09:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-11-07 05:09:51,929 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 28 [2018-11-07 05:09:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:51,930 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-11-07 05:09:51,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:09:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-07 05:09:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 05:09:51,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:51,932 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] [2018-11-07 05:09:51,932 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:51,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1415005035, now seen corresponding path program 1 times [2018-11-07 05:09:51,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:51,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:51,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:52,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:52,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:52,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 05:09:52,148 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 05:09:52,150 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:52,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:52,249 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:09:52,249 INFO L272 AbstractInterpreter]: Visited 23 different actions 92 times. Merged at 8 different actions 48 times. Widened at 1 different actions 6 times. Found 11 fixpoints after 3 different actions. Largest state had 8 variables. [2018-11-07 05:09:52,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:52,265 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:09:52,310 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-11-07 05:09:52,311 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:09:52,807 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-11-07 05:09:52,807 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:09:52,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:52,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-07 05:09:52,808 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:52,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:09:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:09:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:09:52,810 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 12 states. [2018-11-07 05:09:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:53,772 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-07 05:09:53,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:09:53,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-07 05:09:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:53,773 INFO L225 Difference]: With dead ends: 69 [2018-11-07 05:09:53,773 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 05:09:53,774 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:09:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 05:09:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-11-07 05:09:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 05:09:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-07 05:09:53,785 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 28 [2018-11-07 05:09:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:53,785 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-07 05:09:53,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:09:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-07 05:09:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 05:09:53,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:53,786 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] [2018-11-07 05:09:53,787 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:53,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:53,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1416852077, now seen corresponding path program 1 times [2018-11-07 05:09:53,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:53,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:53,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:53,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:53,851 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:53,851 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 05:09:53,851 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [46], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-11-07 05:09:53,854 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:53,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:53,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:09:53,921 INFO L272 AbstractInterpreter]: Visited 24 different actions 90 times. Merged at 7 different actions 47 times. Widened at 1 different actions 6 times. Found 12 fixpoints after 4 different actions. Largest state had 8 variables. [2018-11-07 05:09:53,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:53,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:09:53,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:53,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:09:53,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:53,949 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:09:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:53,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:53,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:54,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:09:54,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 05:09:54,176 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:09:54,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:09:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:09:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:09:54,177 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 5 states. [2018-11-07 05:09:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:54,380 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2018-11-07 05:09:54,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:09:54,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-07 05:09:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:54,382 INFO L225 Difference]: With dead ends: 112 [2018-11-07 05:09:54,382 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 05:09:54,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:09:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 05:09:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2018-11-07 05:09:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 05:09:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-07 05:09:54,397 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 28 [2018-11-07 05:09:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:54,397 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-07 05:09:54,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:09:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-11-07 05:09:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 05:09:54,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:54,399 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:54,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:54,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:54,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1098052710, now seen corresponding path program 2 times [2018-11-07 05:09:54,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:54,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:54,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:54,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:54,400 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:09:54,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:54,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:54,457 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:09:54,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:09:54,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:54,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:09:54,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:09:54,477 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:09:54,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 05:09:54,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:09:54,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:09:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 05:09:54,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:09:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 05:09:54,682 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:54,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2018-11-07 05:09:54,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:54,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:09:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:09:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:09:54,684 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 5 states. [2018-11-07 05:09:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:54,875 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2018-11-07 05:09:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:09:54,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-07 05:09:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:54,878 INFO L225 Difference]: With dead ends: 131 [2018-11-07 05:09:54,878 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 05:09:54,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:09:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 05:09:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-11-07 05:09:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-07 05:09:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-11-07 05:09:54,896 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 32 [2018-11-07 05:09:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:54,896 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-11-07 05:09:54,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:09:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-11-07 05:09:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 05:09:54,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:54,898 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:54,899 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:54,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash 844843622, now seen corresponding path program 1 times [2018-11-07 05:09:54,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:54,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:09:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:54,900 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 05:09:54,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:54,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:54,987 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-07 05:09:54,987 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-07 05:09:54,989 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:54,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:55,238 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:09:55,239 INFO L272 AbstractInterpreter]: Visited 26 different actions 413 times. Merged at 10 different actions 229 times. Widened at 3 different actions 44 times. Found 24 fixpoints after 5 different actions. Largest state had 8 variables. [2018-11-07 05:09:55,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:55,278 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:09:55,355 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 39.47% of their original sizes. [2018-11-07 05:09:55,355 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:09:56,032 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-07 05:09:56,032 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:09:56,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:56,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-07 05:09:56,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:56,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:09:56,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:09:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:09:56,035 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 14 states. [2018-11-07 05:09:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:57,139 INFO L93 Difference]: Finished difference Result 192 states and 237 transitions. [2018-11-07 05:09:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:09:57,139 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-07 05:09:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:57,141 INFO L225 Difference]: With dead ends: 192 [2018-11-07 05:09:57,142 INFO L226 Difference]: Without dead ends: 144 [2018-11-07 05:09:57,143 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:09:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-07 05:09:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2018-11-07 05:09:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-07 05:09:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2018-11-07 05:09:57,169 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 55 [2018-11-07 05:09:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:57,170 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2018-11-07 05:09:57,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:09:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2018-11-07 05:09:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 05:09:57,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:09:57,173 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:09:57,174 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:09:57,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:57,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1237870632, now seen corresponding path program 1 times [2018-11-07 05:09:57,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:09:57,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:57,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:09:57,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:09:57,175 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:09:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:09:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 54 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 05:09:57,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:09:57,458 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:09:57,458 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-07 05:09:57,458 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-11-07 05:09:57,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:09:57,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:09:58,048 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:09:58,049 INFO L272 AbstractInterpreter]: Visited 27 different actions 554 times. Merged at 12 different actions 271 times. Widened at 3 different actions 39 times. Found 72 fixpoints after 8 different actions. Largest state had 8 variables. [2018-11-07 05:09:58,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:09:58,088 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:09:58,189 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 42.92% of their original sizes. [2018-11-07 05:09:58,189 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:09:58,843 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-07 05:09:58,843 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:09:58,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:09:58,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 05:09:58,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:09:58,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:09:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:09:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:09:58,844 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 17 states. [2018-11-07 05:09:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:09:59,906 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2018-11-07 05:09:59,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:09:59,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-07 05:09:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:09:59,906 INFO L225 Difference]: With dead ends: 119 [2018-11-07 05:09:59,907 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:09:59,908 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:09:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:09:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:09:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:09:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:09:59,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-11-07 05:09:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:09:59,909 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:09:59,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:09:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:09:59,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:09:59,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:10:00,134 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 119 [2018-11-07 05:10:00,320 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 109 [2018-11-07 05:10:00,456 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-07 05:10:00,764 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-11-07 05:10:02,034 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 126 DAG size of output: 44 [2018-11-07 05:10:02,625 WARN L179 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 57 [2018-11-07 05:10:03,032 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 45 [2018-11-07 05:10:03,038 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:10:03,039 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:10:03,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:10:03,039 INFO L425 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-11-07 05:10:03,039 INFO L428 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-11-07 05:10:03,039 INFO L425 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-11-07 05:10:03,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:10:03,040 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ (* 2 ~last~0) 4294967296)) (<= ~last~0 199999)) [2018-11-07 05:10:03,040 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:10:03,040 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:10:03,041 INFO L421 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (let ((.cse0 (* 2 main_~c~0)) (.cse1 (+ main_~st~0 199999))) (let ((.cse2 (<= main_~a~0 main_~b~0)) (.cse3 (<= main_~b~0 main_~a~0)) (.cse4 (<= .cse1 main_~c~0)) (.cse5 (<= .cse0 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= 2 (+ main_~a~0 main_~st~0)))) (or (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and (<= 400000 .cse0) (<= main_~c~0 .cse1) .cse2 .cse3 .cse4 (= (mod main_~a~0 2) 0) .cse5 .cse6 (<= (+ ~last~0 main_~c~0) 2147683647) .cse7) (and (and (= main_~b~0 0) (<= (+ main_~a~0 main_~b~0) 0) (<= main_~c~0 main_~a~0)) (<= (+ ~last~0 main_~b~0) 2147483647) (<= main_~b~0 main_~c~0) (<= 0 (+ ~last~0 main_~a~0 2147483648))) (and (<= 200000 (+ main_~st~0 main_~c~0)) (<= ~last~0 199999) .cse2 .cse3 .cse4 .cse5 (<= (+ main_~st~0 1) main_~a~0) .cse6 .cse7) (< 199999 |old(~last~0)|)))) [2018-11-07 05:10:03,041 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (let ((.cse0 (* 2 main_~c~0)) (.cse1 (+ main_~st~0 199999))) (let ((.cse2 (<= main_~a~0 main_~b~0)) (.cse3 (<= main_~b~0 main_~a~0)) (.cse4 (<= .cse1 main_~c~0)) (.cse5 (<= .cse0 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= 2 (+ main_~a~0 main_~st~0)))) (or (and (<= 400000 .cse0) (<= main_~c~0 .cse1) .cse2 .cse3 .cse4 (= (mod main_~a~0 2) 0) .cse5 .cse6 (<= (+ ~last~0 main_~c~0) 2147683647) .cse7) (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and (<= 200000 (+ main_~st~0 main_~c~0)) (<= ~last~0 199999) .cse2 .cse3 .cse4 .cse5 (<= (+ main_~st~0 1) main_~a~0) .cse6 .cse7) (< 199999 |old(~last~0)|)))) [2018-11-07 05:10:03,041 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-07 05:10:03,041 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-11-07 05:10:03,041 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (or (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and (<= 0 (+ (* 2 ~last~0) 4294967296)) (<= ~last~0 199999)) (< 199999 |old(~last~0)|)) [2018-11-07 05:10:03,041 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 34) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 27) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse1 (* 2 main_~st~0))) (let ((.cse0 (<= .cse1 2)) (.cse2 (<= 1 (+ main_~st~0 main_~c~0))) (.cse3 (<= main_~a~0 main_~b~0)) (.cse4 (<= main_~b~0 main_~a~0)) (.cse5 (<= (* 2 main_~c~0) 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= 0 (+ main_~a~0 main_~st~0)))) (or (and .cse0 (<= 2 .cse1) .cse2 .cse3 (<= (* 2 ~last~0) 4294967294) .cse4 (= (mod main_~a~0 2) 0) .cse5 .cse6 .cse7) (< (+ (* 2 |old(~last~0)|) 4294967296) 0) (and .cse0 (<= 0 .cse1) (<= ~last~0 199999) .cse2 .cse3 .cse4 .cse5 .cse6 (<= main_~st~0 (+ main_~b~0 1)) .cse7) (< 199999 |old(~last~0)|)))) [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point L26-5(lines 24 34) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 21 35) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-07 05:10:03,042 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-11-07 05:10:03,042 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-07 05:10:03,043 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-11-07 05:10:03,043 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-11-07 05:10:03,043 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-11-07 05:10:03,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:10:03 BoogieIcfgContainer [2018-11-07 05:10:03,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:10:03,059 INFO L168 Benchmark]: Toolchain (without parser) took 18434.94 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -657.0 MB). Peak memory consumption was 433.5 MB. Max. memory is 7.1 GB. [2018-11-07 05:10:03,060 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:10:03,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:10:03,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:10:03,062 INFO L168 Benchmark]: Boogie Preprocessor took 20.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:10:03,063 INFO L168 Benchmark]: RCFGBuilder took 510.47 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:10:03,064 INFO L168 Benchmark]: TraceAbstraction took 17568.73 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 366.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.3 MB). Peak memory consumption was 472.8 MB. Max. memory is 7.1 GB. [2018-11-07 05:10:03,068 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.24 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. * CACSL2BoogieTranslator took 313.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 17.63 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 20.48 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 510.47 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17568.73 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 366.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.3 MB). Peak memory consumption was 472.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((((((2 * st <= 2 && 2 <= 2 * st) && 1 <= st + c) && a <= b) && 2 * last <= 4294967294) && b <= a) && a % 2 == 0) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && 0 <= a + st) || 2 * \old(last) + 4294967296 < 0) || (((((((((2 * st <= 2 && 0 <= 2 * st) && last <= 199999) && 1 <= st + c) && a <= b) && b <= a) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && st <= b + 1) && 0 <= a + st)) || 199999 < \old(last) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((2 * \old(last) + 4294967296 < 0 || (((((((((400000 <= 2 * c && c <= st + 199999) && a <= b) && b <= a) && st + 199999 <= c) && a % 2 == 0) && 2 * c <= 400000) && 0 <= last + st + 2147483647) && last + c <= 2147683647) && 2 <= a + st)) || (((((b == 0 && a + b <= 0) && c <= a) && last + b <= 2147483647) && b <= c) && 0 <= last + a + 2147483648)) || ((((((((200000 <= st + c && last <= 199999) && a <= b) && b <= a) && st + 199999 <= c) && 2 * c <= 400000) && st + 1 <= a) && 0 <= last + st + 2147483647) && 2 <= a + st)) || 199999 < \old(last) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 11 OverallIterations, 8 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 266 SDslu, 645 SDs, 0 SdLazy, 308 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 374 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9096320346320347 AbsIntWeakeningRatio, 0.5281385281385281 AbsIntAvgWeakeningVarsNumRemoved, 19.874458874458874 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 92 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 24 PreInvPairs, 51 NumberOfFragments, 377 HoareAnnotationTreeSize, 24 FomulaSimplifications, 14130 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2066 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 397 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 24902 SizeOfPredicates, 6 NumberOfNonLiveVariables, 147 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 194/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...