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-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:36:24,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:36:24,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:36:24,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:36:24,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:36:24,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:36:24,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:36:24,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:36:24,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:36:24,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:36:24,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:36:24,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:36:24,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:36:24,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:36:24,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:36:24,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:36:24,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:36:24,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:36:24,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:36:24,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:36:24,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:36:24,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:36:24,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:36:24,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:36:24,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:36:24,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:36:24,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:36:24,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:36:24,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:36:24,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:36:24,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:36:24,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:36:24,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:36:24,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:36:24,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:36:24,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:36:24,214 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:36:24,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:36:24,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:36:24,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:36:24,242 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:36:24,242 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:36:24,242 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:36:24,244 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:36:24,244 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:36:24,244 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:36:24,244 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:36:24,244 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:36:24,245 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:36:24,245 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:36:24,245 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:36:24,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:36:24,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:36:24,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:36:24,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:36:24,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:36:24,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:36:24,248 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:36:24,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:36:24,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:36:24,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:36:24,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:36:24,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:36:24,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:36:24,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:36:24,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:36:24,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:36:24,251 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:36:24,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:36:24,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:36:24,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:36:24,252 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:36:24,252 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:36:24,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:36:24,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:36:24,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:36:24,326 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:36:24,326 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:36:24,327 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-07 10:36:24,392 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/224201f2d/f8d6644fd3bc4245bebd6f801bfa150b/FLAGde63b0fdd [2018-11-07 10:36:24,840 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:36:24,841 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-07 10:36:24,849 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/224201f2d/f8d6644fd3bc4245bebd6f801bfa150b/FLAGde63b0fdd [2018-11-07 10:36:24,874 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/224201f2d/f8d6644fd3bc4245bebd6f801bfa150b [2018-11-07 10:36:24,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:36:24,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:36:24,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:24,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:36:24,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:36:24,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:24" (1/1) ... [2018-11-07 10:36:24,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531eb58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:24, skipping insertion in model container [2018-11-07 10:36:24,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:24" (1/1) ... [2018-11-07 10:36:24,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:36:24,939 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:36:25,196 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:25,205 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:36:25,235 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:25,255 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:36:25,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25 WrapperNode [2018-11-07 10:36:25,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:25,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:25,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:36:25,257 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:36:25,264 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:36:25" (1/1) ... [2018-11-07 10:36:25,271 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:36:25" (1/1) ... [2018-11-07 10:36:25,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:25,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:36:25,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:36:25,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:36:25,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (1/1) ... [2018-11-07 10:36:25,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (1/1) ... [2018-11-07 10:36:25,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (1/1) ... [2018-11-07 10:36:25,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (1/1) ... [2018-11-07 10:36:25,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (1/1) ... [2018-11-07 10:36:25,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (1/1) ... [2018-11-07 10:36:25,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (1/1) ... [2018-11-07 10:36:25,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:36:25,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:36:25,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:36:25,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:36:25,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (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 10:36:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:36:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:36:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:36:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:36:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:36:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:36:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:36:25,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:36:25,939 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:36:25,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:25 BoogieIcfgContainer [2018-11-07 10:36:25,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:36:25,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:36:25,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:36:25,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:36:25,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:36:24" (1/3) ... [2018-11-07 10:36:25,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31225363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:25, skipping insertion in model container [2018-11-07 10:36:25,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:25" (2/3) ... [2018-11-07 10:36:25,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31225363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:25, skipping insertion in model container [2018-11-07 10:36:25,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:25" (3/3) ... [2018-11-07 10:36:25,949 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2018-11-07 10:36:25,959 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:36:25,968 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:36:25,985 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:36:26,020 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:36:26,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:36:26,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:36:26,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:36:26,021 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:36:26,021 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:36:26,021 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:36:26,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:36:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-07 10:36:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:36:26,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:26,048 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:26,051 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:26,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash -372910930, now seen corresponding path program 1 times [2018-11-07 10:36:26,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:26,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:26,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:26,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:26,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:26,297 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 10:36:26,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:26,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:36:26,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:36:26,321 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2018-11-07 10:36:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:26,801 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-11-07 10:36:26,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:26,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 10:36:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:26,813 INFO L225 Difference]: With dead ends: 90 [2018-11-07 10:36:26,813 INFO L226 Difference]: Without dead ends: 47 [2018-11-07 10:36:26,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:36:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-07 10:36:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-07 10:36:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 10:36:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2018-11-07 10:36:26,871 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 15 [2018-11-07 10:36:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:26,872 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-11-07 10:36:26,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2018-11-07 10:36:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:36:26,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:26,874 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:26,875 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:26,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash -394866897, now seen corresponding path program 1 times [2018-11-07 10:36:26,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:26,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:26,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:26,987 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 10:36:26,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:26,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:36:26,991 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:26,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:26,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:26,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:36:26,993 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2018-11-07 10:36:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:27,206 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-07 10:36:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:27,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 10:36:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:27,211 INFO L225 Difference]: With dead ends: 58 [2018-11-07 10:36:27,211 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 10:36:27,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:36:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 10:36:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-07 10:36:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 10:36:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2018-11-07 10:36:27,237 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 15 [2018-11-07 10:36:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:27,238 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2018-11-07 10:36:27,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2018-11-07 10:36:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:36:27,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:27,239 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 10:36:27,239 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:27,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1825950327, now seen corresponding path program 1 times [2018-11-07 10:36:27,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:27,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:27,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:27,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:27,469 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:27,470 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 10:36:27,472 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109] [2018-11-07 10:36:27,507 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:27,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:27,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:27,643 INFO L272 AbstractInterpreter]: Visited 19 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-07 10:36:27,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:27,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:27,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:27,654 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 10:36:27,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:27,668 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:27,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:27,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:27,864 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:27,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 9 [2018-11-07 10:36:27,865 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:27,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:27,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:27,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:36:27,866 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand 5 states. [2018-11-07 10:36:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:28,080 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-07 10:36:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:28,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-07 10:36:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:28,086 INFO L225 Difference]: With dead ends: 58 [2018-11-07 10:36:28,086 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 10:36:28,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:36:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 10:36:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-07 10:36:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 10:36:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-11-07 10:36:28,114 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 20 [2018-11-07 10:36:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:28,115 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-07 10:36:28,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2018-11-07 10:36:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 10:36:28,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:28,117 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] [2018-11-07 10:36:28,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:28,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash -443407858, now seen corresponding path program 1 times [2018-11-07 10:36:28,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:28,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:28,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:28,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:28,121 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:36:28,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:28,521 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:28,521 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-07 10:36:28,521 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109], [110], [111] [2018-11-07 10:36:28,523 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:28,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:28,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:28,564 INFO L272 AbstractInterpreter]: Visited 21 different actions 31 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-07 10:36:28,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:28,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:28,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:28,573 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 10:36:28,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:28,582 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:28,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:36:28,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:36:28,778 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:28,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 13 [2018-11-07 10:36:28,779 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:28,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:36:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:36:28,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:36:28,780 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand 6 states. [2018-11-07 10:36:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:29,113 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-07 10:36:29,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:36:29,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-07 10:36:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:29,115 INFO L225 Difference]: With dead ends: 62 [2018-11-07 10:36:29,115 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 10:36:29,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:36:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 10:36:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-07 10:36:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:36:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2018-11-07 10:36:29,130 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 25 [2018-11-07 10:36:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:29,131 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2018-11-07 10:36:29,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:36:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-07 10:36:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 10:36:29,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:29,133 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:29,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:29,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash -105052009, now seen corresponding path program 1 times [2018-11-07 10:36:29,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:29,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:29,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:29,219 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:29,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-07 10:36:29,220 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [52], [68], [71], [73], [76], [78], [79], [80], [81], [107], [108], [109], [110], [111], [112], [113] [2018-11-07 10:36:29,222 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:29,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:29,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:29,283 INFO L272 AbstractInterpreter]: Visited 23 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-07 10:36:29,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:29,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:29,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:29,292 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 10:36:29,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:29,305 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:29,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:36:29,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:36:29,472 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:29,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 9 [2018-11-07 10:36:29,473 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:29,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:29,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:29,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:36:29,474 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 5 states. [2018-11-07 10:36:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:29,663 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-11-07 10:36:29,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:29,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-07 10:36:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:29,666 INFO L225 Difference]: With dead ends: 68 [2018-11-07 10:36:29,666 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 10:36:29,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:36:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 10:36:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-07 10:36:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 10:36:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-11-07 10:36:29,679 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 30 [2018-11-07 10:36:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:29,680 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2018-11-07 10:36:29,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-07 10:36:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-07 10:36:29,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:29,682 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:29,682 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:29,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1255310588, now seen corresponding path program 1 times [2018-11-07 10:36:29,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:29,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:29,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:36:29,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:29,900 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:29,900 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-07 10:36:29,901 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-07 10:36:29,903 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:29,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:29,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:29,952 INFO L272 AbstractInterpreter]: Visited 32 different actions 62 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-07 10:36:29,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:29,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:29,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:29,963 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 10:36:29,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:29,973 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:30,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:36:30,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 10:36:30,245 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:30,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-11-07 10:36:30,245 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:30,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:36:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:36:30,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:36:30,246 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 6 states. [2018-11-07 10:36:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:30,411 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-11-07 10:36:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:36:30,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-07 10:36:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:30,414 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:36:30,414 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 10:36:30,415 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:36:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 10:36:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-11-07 10:36:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 10:36:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2018-11-07 10:36:30,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 48 [2018-11-07 10:36:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:30,428 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-11-07 10:36:30,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:36:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2018-11-07 10:36:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 10:36:30,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:30,433 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:30,434 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:30,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:30,434 INFO L82 PathProgramCache]: Analyzing trace with hash -979286812, now seen corresponding path program 1 times [2018-11-07 10:36:30,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:30,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:30,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:30,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 10:36:30,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:30,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:30,575 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-07 10:36:30,575 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99] [2018-11-07 10:36:30,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:30,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:30,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:30,638 INFO L272 AbstractInterpreter]: Visited 36 different actions 76 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-07 10:36:30,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:30,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:30,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:30,641 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:30,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:30,651 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:30,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:36:30,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 10:36:30,872 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:30,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 14 [2018-11-07 10:36:30,872 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:30,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:36:30,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:36:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:36:30,873 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 7 states. [2018-11-07 10:36:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:31,121 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-11-07 10:36:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:36:31,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-11-07 10:36:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:31,125 INFO L225 Difference]: With dead ends: 78 [2018-11-07 10:36:31,125 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 10:36:31,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:36:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 10:36:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-11-07 10:36:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 10:36:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-11-07 10:36:31,148 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 58 [2018-11-07 10:36:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:31,148 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-07 10:36:31,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:36:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-07 10:36:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 10:36:31,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:31,155 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:31,156 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:31,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2026132663, now seen corresponding path program 1 times [2018-11-07 10:36:31,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:31,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:31,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:31,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-07 10:36:31,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:31,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:31,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-07 10:36:31,322 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [17], [21], [26], [29], [32], [37], [42], [47], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103] [2018-11-07 10:36:31,325 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:31,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:31,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:31,377 INFO L272 AbstractInterpreter]: Visited 41 different actions 91 times. Never merged. Never widened. Never found a fixpoint. Largest state had 12 variables. [2018-11-07 10:36:31,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:31,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:31,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:31,409 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:31,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:31,418 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:31,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:36:31,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 10:36:31,753 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:31,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10] total 15 [2018-11-07 10:36:31,753 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:31,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 10:36:31,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 10:36:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:36:31,755 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 8 states. [2018-11-07 10:36:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:32,246 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-07 10:36:32,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:36:32,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-11-07 10:36:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:32,248 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:36:32,248 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:36:32,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:36:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:36:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:36:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:36:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:36:32,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-11-07 10:36:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:32,251 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:36:32,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 10:36:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:36:32,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:36:32,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:36:32,679 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 10:36:32,679 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:36:32,679 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:36:32,679 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:36:32,679 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:36:32,679 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:36:32,680 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,680 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2018-11-07 10:36:32,680 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,680 INFO L421 ceAbstractionStarter]: At program point L23-1(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,680 INFO L421 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,680 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,680 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,681 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,681 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-07 10:36:32,681 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 51) no Hoare annotation was computed. [2018-11-07 10:36:32,681 INFO L421 ceAbstractionStarter]: At program point L20-3(lines 20 51) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,681 INFO L425 ceAbstractionStarter]: For program point L20-4(lines 20 51) no Hoare annotation was computed. [2018-11-07 10:36:32,681 INFO L421 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,681 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,681 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-07 10:36:32,682 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 10:36:32,682 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 50) no Hoare annotation was computed. [2018-11-07 10:36:32,682 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 50) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,682 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-07 10:36:32,682 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 10:36:32,682 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2018-11-07 10:36:32,682 INFO L421 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,682 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,683 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,683 INFO L421 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,683 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2018-11-07 10:36:32,683 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,684 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,684 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2018-11-07 10:36:32,684 INFO L421 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-11-07 10:36:32,684 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-07 10:36:32,684 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-07 10:36:32,684 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 10:36:32,684 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:36:32,685 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 10:36:32,685 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 10:36:32,685 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 10:36:32,685 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:36:32,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:36:32 BoogieIcfgContainer [2018-11-07 10:36:32,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:36:32,701 INFO L168 Benchmark]: Toolchain (without parser) took 7812.42 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -260.2 MB). Peak memory consumption was 461.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:32,704 INFO L168 Benchmark]: CDTParser took 0.22 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 10:36:32,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.08 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 10:36:32,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.04 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 10:36:32,706 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 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 10:36:32,706 INFO L168 Benchmark]: RCFGBuilder took 628.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:32,707 INFO L168 Benchmark]: TraceAbstraction took 6758.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 496.4 MB). Peak memory consumption was 496.4 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:32,712 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.22 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 365.08 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 21.04 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 34.23 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 628.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6758.86 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 496.4 MB). Peak memory consumption was 496.4 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: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((0 <= j && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize) && limit + 4 <= bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. SAFE Result, 6.6s OverallTime, 8 OverallIterations, 11 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 117 SDslu, 1047 SDs, 0 SdLazy, 519 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 490 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 369 HoareAnnotationTreeSize, 55 FomulaSimplifications, 621 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 81480 SizeOfPredicates, 23 NumberOfNonLiveVariables, 538 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1206/1284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...