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-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:11:43,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:11:43,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:11:43,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:11:43,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:11:43,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:11:43,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:11:43,207 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:11:43,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:11:43,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:11:43,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:11:43,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:11:43,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:11:43,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:11:43,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:11:43,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:11:43,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:11:43,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:11:43,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:11:43,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:11:43,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:11:43,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:11:43,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:11:43,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:11:43,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:11:43,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:11:43,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:11:43,245 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:11:43,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:11:43,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:11:43,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:11:43,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:11:43,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:11:43,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:11:43,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:11:43,256 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:11:43,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:11:43,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:11:43,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:11:43,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:11:43,288 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:11:43,289 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:11:43,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:11:43,289 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:11:43,289 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:11:43,289 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:11:43,290 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:11:43,290 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:11:43,290 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:11:43,290 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:11:43,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:11:43,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:11:43,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:11:43,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:11:43,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:11:43,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:11:43,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:11:43,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:11:43,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:11:43,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:11:43,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:11:43,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:11:43,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:11:43,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:11:43,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:11:43,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:11:43,296 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:11:43,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:11:43,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:11:43,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:11:43,296 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:11:43,296 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:11:43,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:11:43,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:11:43,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:11:43,371 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:11:43,371 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:11:43,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-07 22:11:43,445 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324ee6b93/be500adb0e0c4642bf0c42642890f6e6/FLAG5d2d449c6 [2018-11-07 22:11:43,897 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:11:43,898 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-07 22:11:43,905 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324ee6b93/be500adb0e0c4642bf0c42642890f6e6/FLAG5d2d449c6 [2018-11-07 22:11:43,920 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324ee6b93/be500adb0e0c4642bf0c42642890f6e6 [2018-11-07 22:11:43,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:11:43,934 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:11:43,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:11:43,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:11:43,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:11:43,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:43" (1/1) ... [2018-11-07 22:11:43,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:43, skipping insertion in model container [2018-11-07 22:11:43,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:43" (1/1) ... [2018-11-07 22:11:43,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:11:43,974 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:11:44,142 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:11:44,146 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:11:44,166 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:11:44,181 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:11:44,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44 WrapperNode [2018-11-07 22:11:44,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:11:44,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:11:44,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:11:44,183 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:11:44,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:11:44,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:11:44,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:11:44,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:11:44,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (1/1) ... [2018-11-07 22:11:44,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:11:44,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:11:44,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:11:44,232 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:11:44,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11: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 22:11:44,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:11:44,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:11:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:11:44,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:11:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:11:44,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:11:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:11:44,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:11:44,745 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:11:44,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:44 BoogieIcfgContainer [2018-11-07 22:11:44,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:11:44,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:11:44,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:11:44,749 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:11:44,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:11:43" (1/3) ... [2018-11-07 22:11:44,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f84c357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:44, skipping insertion in model container [2018-11-07 22:11:44,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:44" (2/3) ... [2018-11-07 22:11:44,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f84c357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:44, skipping insertion in model container [2018-11-07 22:11:44,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:44" (3/3) ... [2018-11-07 22:11:44,752 INFO L112 eAbstractionObserver]: Analyzing ICFG large_const_true-unreach-call_true-termination.i [2018-11-07 22:11:44,760 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:11:44,767 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:11:44,785 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:11:44,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:11:44,818 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:11:44,818 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:11:44,818 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:11:44,819 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:11:44,819 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:11:44,819 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:11:44,819 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:11:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-07 22:11:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:11:44,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:44,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:44,847 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:44,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1169309281, now seen corresponding path program 1 times [2018-11-07 22:11:44,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:44,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:44,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:44,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:44,900 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:44,965 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 22:11:44,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:11:44,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:11:44,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:44,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:11:44,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:11:44,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:11:44,986 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-07 22:11:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:45,007 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-07 22:11:45,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:11:45,010 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 22:11:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:45,019 INFO L225 Difference]: With dead ends: 43 [2018-11-07 22:11:45,019 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 22:11:45,022 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 22:11:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 22:11:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 22:11:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 22:11:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-07 22:11:45,061 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-11-07 22:11:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:45,061 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-07 22:11:45,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:11:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-07 22:11:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:11:45,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:45,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:45,065 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:45,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -659000362, now seen corresponding path program 1 times [2018-11-07 22:11:45,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:45,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:45,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:45,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:45,181 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 22:11:45,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:11:45,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:11:45,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:45,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:11:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:11:45,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:11:45,184 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2018-11-07 22:11:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:45,319 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-07 22:11:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:11:45,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 22:11:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:45,320 INFO L225 Difference]: With dead ends: 37 [2018-11-07 22:11:45,320 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 22:11:45,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:11:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 22:11:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 22:11:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 22:11:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-07 22:11:45,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-11-07 22:11:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:45,328 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-07 22:11:45,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:11:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-07 22:11:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:11:45,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:45,329 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:45,330 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:45,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash 701537581, now seen corresponding path program 1 times [2018-11-07 22:11:45,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:45,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:45,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:45,574 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 22:11:45,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:45,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:45,576 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-07 22:11:45,578 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [25], [37], [41], [47], [55], [58], [60], [66], [67], [68], [70] [2018-11-07 22:11:45,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:45,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:45,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:45,786 INFO L272 AbstractInterpreter]: Visited 18 different actions 24 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-11-07 22:11:45,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:45,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:45,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:45,832 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 22:11:45,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:45,851 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:45,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:46,011 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 22:11:46,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:46,361 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 22:11:46,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:46,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:11:46,384 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:46,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:11:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:11:46,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:11:46,386 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 8 states. [2018-11-07 22:11:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:46,669 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-07 22:11:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:11:46,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-07 22:11:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:46,673 INFO L225 Difference]: With dead ends: 47 [2018-11-07 22:11:46,673 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 22:11:46,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:11:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 22:11:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-07 22:11:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 22:11:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-07 22:11:46,686 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 19 [2018-11-07 22:11:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:46,687 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-07 22:11:46,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:11:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-07 22:11:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 22:11:46,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:46,688 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:46,689 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:46,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1708424439, now seen corresponding path program 1 times [2018-11-07 22:11:46,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:46,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:46,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:46,691 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:46,813 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 22:11:46,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:46,814 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:46,814 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 22:11:46,814 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [27], [32], [37], [41], [47], [55], [58], [60], [66], [67], [68], [70] [2018-11-07 22:11:46,816 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:46,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:46,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:46,867 INFO L272 AbstractInterpreter]: Visited 19 different actions 25 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-11-07 22:11:46,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:46,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:46,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:46,900 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 22:11:46,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:46,909 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:46,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:47,258 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 22:11:47,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:47,365 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 22:11:47,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:47,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:11:47,389 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:47,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:11:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:11:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:11:47,391 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-11-07 22:11:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:47,544 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-07 22:11:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:11:47,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-07 22:11:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:47,548 INFO L225 Difference]: With dead ends: 59 [2018-11-07 22:11:47,548 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 22:11:47,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:11:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 22:11:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-11-07 22:11:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 22:11:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-07 22:11:47,559 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 20 [2018-11-07 22:11:47,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:47,560 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-07 22:11:47,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:11:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-07 22:11:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 22:11:47,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:47,561 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:47,561 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:47,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1315397429, now seen corresponding path program 1 times [2018-11-07 22:11:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:47,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:47,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:47,680 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 22:11:47,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:47,681 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:47,681 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 22:11:47,681 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [27], [30], [37], [41], [47], [55], [58], [60], [66], [67], [68], [70] [2018-11-07 22:11:47,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:47,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:47,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:47,720 INFO L272 AbstractInterpreter]: Visited 19 different actions 25 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-11-07 22:11:47,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:47,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:47,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:47,726 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:47,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:47,736 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:47,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:47,838 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 22:11:47,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:47,939 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 22:11:47,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:11:47,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:11:47,959 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:11:47,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:11:47,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:11:47,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:11:47,960 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 8 states. [2018-11-07 22:11:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:48,172 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-07 22:11:48,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:11:48,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-07 22:11:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:48,174 INFO L225 Difference]: With dead ends: 64 [2018-11-07 22:11:48,174 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 22:11:48,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:11:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 22:11:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2018-11-07 22:11:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 22:11:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2018-11-07 22:11:48,184 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 20 [2018-11-07 22:11:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:48,185 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2018-11-07 22:11:48,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:11:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-07 22:11:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 22:11:48,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:48,186 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] [2018-11-07 22:11:48,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:48,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1019570158, now seen corresponding path program 1 times [2018-11-07 22:11:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:48,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:48,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:48,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:48,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:48,252 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 22:11:48,253 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [25], [27], [32], [37], [41], [47], [55], [58], [60], [66], [67], [68], [70] [2018-11-07 22:11:48,255 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:48,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:48,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:48,421 INFO L272 AbstractInterpreter]: Visited 20 different actions 104 times. Merged at 10 different actions 56 times. Widened at 2 different actions 5 times. Found 9 fixpoints after 4 different actions. Largest state had 17 variables. [2018-11-07 22:11:48,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:48,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:48,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:48,454 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:48,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:48,464 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:48,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:48,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 22:11:48,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2018-11-07 22:11:48,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:48,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:11:48,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:11:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:11:48,568 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 5 states. [2018-11-07 22:11:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:48,597 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-07 22:11:48,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:11:48,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-07 22:11:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:48,601 INFO L225 Difference]: With dead ends: 73 [2018-11-07 22:11:48,601 INFO L226 Difference]: Without dead ends: 35 [2018-11-07 22:11:48,602 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:11:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-07 22:11:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-07 22:11:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 22:11:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 22:11:48,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2018-11-07 22:11:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:48,620 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 22:11:48,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:11:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 22:11:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 22:11:48,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:48,622 INFO L375 BasicCegarLoop]: trace histogram [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 22:11:48,622 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:48,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:48,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1155724272, now seen corresponding path program 1 times [2018-11-07 22:11:48,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:48,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:48,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:48,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:11:48,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:11:48,753 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:48,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:11:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:11:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:11:48,754 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-11-07 22:11:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:49,005 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-07 22:11:49,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:11:49,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-07 22:11:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:49,006 INFO L225 Difference]: With dead ends: 34 [2018-11-07 22:11:49,006 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:11:49,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:11:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:11:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:11:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:11:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:11:49,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-07 22:11:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:49,009 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:11:49,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:11:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:11:49,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:11:49,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:11:49,309 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-11-07 22:11:49,584 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-07 22:11:49,588 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 22:11:49,588 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:11:49,588 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:11:49,588 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:11:49,589 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:11:49,589 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:11:49,589 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~k~0) (<= main_~n~0 (+ main_~j~0 1))) [2018-11-07 22:11:49,589 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-11-07 22:11:49,589 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2018-11-07 22:11:49,589 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-07 22:11:49,589 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-07 22:11:49,589 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2018-11-07 22:11:49,589 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2018-11-07 22:11:49,590 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2018-11-07 22:11:49,590 INFO L421 ceAbstractionStarter]: At program point L32-3(lines 32 36) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 main_~j~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (<= main_~n~0 1)) (.cse1 (<= 10000 main_~c3~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (<= 4000 main_~c1~0))) (or (and (<= main_~n~0 0) (<= main_~i~0 0) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse0) (and .cse4 .cse5 (and .cse1 .cse2 .cse3 (<= 2000 main_~k~0)) (<= main_~n~0 (+ main_~j~0 1))))) [2018-11-07 22:11:49,590 INFO L425 ceAbstractionStarter]: For program point L32-4(lines 32 36) no Hoare annotation was computed. [2018-11-07 22:11:49,590 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-11-07 22:11:49,590 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-11-07 22:11:49,590 INFO L421 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 4000 main_~c1~0))) (or (and (and .cse0 .cse1 .cse2 (<= 1 main_~i~0) (<= 2000 main_~k~0)) (<= main_~n~0 1)) (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0)))) [2018-11-07 22:11:49,590 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 30) no Hoare annotation was computed. [2018-11-07 22:11:49,590 INFO L425 ceAbstractionStarter]: For program point L20-3(lines 20 30) no Hoare annotation was computed. [2018-11-07 22:11:49,591 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 22:11:49,593 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:11:49,593 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 22:11:49,593 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 22:11:49,593 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 22:11:49,593 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:11:49,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:11:49 BoogieIcfgContainer [2018-11-07 22:11:49,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:11:49,611 INFO L168 Benchmark]: Toolchain (without parser) took 5677.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -475.6 MB). Peak memory consumption was 252.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:11:49,612 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:11:49,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.97 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 22:11:49,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.94 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 22:11:49,614 INFO L168 Benchmark]: Boogie Preprocessor took 25.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:11:49,615 INFO L168 Benchmark]: RCFGBuilder took 513.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:11:49,616 INFO L168 Benchmark]: TraceAbstraction took 4863.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.5 MB). Peak memory consumption was 294.5 MB. Max. memory is 7.1 GB. [2018-11-07 22:11:49,621 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.97 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 22.94 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 25.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 513.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4863.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 294.5 MB). Peak memory consumption was 294.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 32]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 0) && n <= j) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && n <= 1) && n <= j)) || (((1 <= i && n <= 1) && ((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 2000 <= k) && n <= j + 1) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 2000 <= k) && n <= 1) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 0 <= i) && 0 <= k) && i <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 4.7s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 190 SDtfs, 135 SDslu, 439 SDs, 0 SdLazy, 222 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 19 NumberOfFragments, 125 HoareAnnotationTreeSize, 13 FomulaSimplifications, 127 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 14542 SizeOfPredicates, 11 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 27/49 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...