/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:18:13,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:18:13,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:18:13,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:18:13,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:18:13,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:18:13,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:18:13,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:18:13,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:18:13,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:18:13,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:18:13,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:18:13,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:18:13,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:18:13,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:18:13,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:18:13,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:18:13,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:18:13,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:18:13,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:18:13,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:18:13,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:18:13,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:18:13,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:18:13,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:18:13,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:18:13,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:18:13,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:18:13,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:18:13,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:18:13,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:18:13,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:18:13,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:18:13,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:18:13,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:18:13,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:18:13,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:18:13,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:18:13,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:18:13,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:18:13,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:18:13,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:18:13,940 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:18:13,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:18:13,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:18:13,942 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:18:13,942 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:18:13,943 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:18:13,943 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:18:13,943 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:18:13,943 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:18:13,943 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:18:13,945 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:18:13,945 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:18:13,945 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:18:13,945 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:18:13,946 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:18:13,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:18:13,947 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:18:13,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:18:13,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:18:13,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:18:13,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:18:13,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:18:13,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:18:13,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:18:13,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:18:13,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:18:13,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:18:13,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:18:13,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:18:13,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:18:13,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:18:13,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:18:13,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:18:13,951 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:18:13,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:18:13,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:18:13,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:18:13,952 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:18:14,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:18:14,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:18:14,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:18:14,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:18:14,264 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:18:14,265 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-11-24 04:18:14,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28888958/22da1de3822748dd85aa0578b6cd3432/FLAG086a30791 [2019-11-24 04:18:14,771 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:18:14,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2019-11-24 04:18:14,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28888958/22da1de3822748dd85aa0578b6cd3432/FLAG086a30791 [2019-11-24 04:18:15,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28888958/22da1de3822748dd85aa0578b6cd3432 [2019-11-24 04:18:15,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:18:15,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:18:15,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:15,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:18:15,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:18:15,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ff2346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15, skipping insertion in model container [2019-11-24 04:18:15,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:18:15,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:18:15,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:15,410 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:18:15,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:15,450 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:18:15,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15 WrapperNode [2019-11-24 04:18:15,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:15,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:15,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:18:15,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:18:15,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:15,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:18:15,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:18:15,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:18:15,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (1/1) ... [2019-11-24 04:18:15,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:18:15,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:18:15,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:18:15,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:18:15,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (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 [2019-11-24 04:18:15,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:18:15,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:18:16,078 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:18:16,079 INFO L284 CfgBuilder]: Removed 38 assume(true) statements. [2019-11-24 04:18:16,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:16 BoogieIcfgContainer [2019-11-24 04:18:16,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:18:16,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:18:16,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:18:16,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:18:16,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:18:15" (1/3) ... [2019-11-24 04:18:16,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d2d395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:16, skipping insertion in model container [2019-11-24 04:18:16,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:15" (2/3) ... [2019-11-24 04:18:16,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d2d395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:16, skipping insertion in model container [2019-11-24 04:18:16,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:16" (3/3) ... [2019-11-24 04:18:16,088 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-11-24 04:18:16,095 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:18:16,101 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-24 04:18:16,111 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-24 04:18:16,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:18:16,135 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:18:16,135 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:18:16,136 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:18:16,136 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:18:16,136 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:18:16,136 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:18:16,136 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:18:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-24 04:18:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:18:16,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:16,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:16,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1479268755, now seen corresponding path program 1 times [2019-11-24 04:18:16,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:16,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621855166] [2019-11-24 04:18:16,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:16,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621855166] [2019-11-24 04:18:16,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:16,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:18:16,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048994707] [2019-11-24 04:18:16,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:18:16,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:18:16,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:18:16,359 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-24 04:18:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:16,532 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2019-11-24 04:18:16,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:18:16,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-24 04:18:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:16,549 INFO L225 Difference]: With dead ends: 148 [2019-11-24 04:18:16,549 INFO L226 Difference]: Without dead ends: 73 [2019-11-24 04:18:16,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:18:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-24 04:18:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-11-24 04:18:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 04:18:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-24 04:18:16,629 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 7 [2019-11-24 04:18:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:16,630 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-24 04:18:16,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:18:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-24 04:18:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:18:16,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:16,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:16,632 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1391586898, now seen corresponding path program 1 times [2019-11-24 04:18:16,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:16,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171490668] [2019-11-24 04:18:16,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:16,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171490668] [2019-11-24 04:18:16,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:16,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:16,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322124044] [2019-11-24 04:18:16,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:16,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:16,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:16,720 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 4 states. [2019-11-24 04:18:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:16,884 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-11-24 04:18:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:16,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-24 04:18:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:16,888 INFO L225 Difference]: With dead ends: 76 [2019-11-24 04:18:16,888 INFO L226 Difference]: Without dead ends: 72 [2019-11-24 04:18:16,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-24 04:18:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2019-11-24 04:18:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-24 04:18:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-11-24 04:18:16,900 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 8 [2019-11-24 04:18:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:16,900 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-11-24 04:18:16,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-11-24 04:18:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:18:16,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:16,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:16,902 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:16,902 INFO L82 PathProgramCache]: Analyzing trace with hash 57057392, now seen corresponding path program 1 times [2019-11-24 04:18:16,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:16,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045651548] [2019-11-24 04:18:16,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:16,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045651548] [2019-11-24 04:18:16,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:16,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:16,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325918056] [2019-11-24 04:18:16,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:16,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:16,958 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2019-11-24 04:18:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:17,092 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-24 04:18:17,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:17,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-24 04:18:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:17,104 INFO L225 Difference]: With dead ends: 69 [2019-11-24 04:18:17,104 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:18:17,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:18:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-11-24 04:18:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-24 04:18:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-24 04:18:17,116 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 9 [2019-11-24 04:18:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:17,116 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-24 04:18:17,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-24 04:18:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:18:17,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:17,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:17,118 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1711132744, now seen corresponding path program 1 times [2019-11-24 04:18:17,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:17,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044162164] [2019-11-24 04:18:17,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:17,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044162164] [2019-11-24 04:18:17,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:17,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:17,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016691988] [2019-11-24 04:18:17,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:17,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:17,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:17,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:17,174 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2019-11-24 04:18:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:17,340 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-11-24 04:18:17,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:17,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-24 04:18:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:17,341 INFO L225 Difference]: With dead ends: 61 [2019-11-24 04:18:17,341 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 04:18:17,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:18:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 04:18:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-24 04:18:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-24 04:18:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-24 04:18:17,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2019-11-24 04:18:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:17,360 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-24 04:18:17,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-24 04:18:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:18:17,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:17,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:17,365 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash 574068571, now seen corresponding path program 1 times [2019-11-24 04:18:17,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:17,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960972468] [2019-11-24 04:18:17,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:17,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960972468] [2019-11-24 04:18:17,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:17,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:17,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362687960] [2019-11-24 04:18:17,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:17,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:17,442 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2019-11-24 04:18:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:17,565 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-24 04:18:17,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:18:17,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 04:18:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:17,567 INFO L225 Difference]: With dead ends: 58 [2019-11-24 04:18:17,567 INFO L226 Difference]: Without dead ends: 50 [2019-11-24 04:18:17,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-24 04:18:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-24 04:18:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-24 04:18:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-24 04:18:17,577 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2019-11-24 04:18:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:17,578 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-24 04:18:17,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-24 04:18:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:18:17,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:17,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:17,579 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:17,580 INFO L82 PathProgramCache]: Analyzing trace with hash -470786895, now seen corresponding path program 1 times [2019-11-24 04:18:17,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:17,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842599408] [2019-11-24 04:18:17,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:17,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842599408] [2019-11-24 04:18:17,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:17,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:17,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610102215] [2019-11-24 04:18:17,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:17,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:17,676 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-11-24 04:18:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:17,773 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-24 04:18:17,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:17,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 04:18:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:17,776 INFO L225 Difference]: With dead ends: 58 [2019-11-24 04:18:17,777 INFO L226 Difference]: Without dead ends: 56 [2019-11-24 04:18:17,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-24 04:18:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-24 04:18:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-24 04:18:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-24 04:18:17,785 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2019-11-24 04:18:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:17,785 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-24 04:18:17,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-24 04:18:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:18:17,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:17,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:17,787 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1892453097, now seen corresponding path program 1 times [2019-11-24 04:18:17,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:17,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709636311] [2019-11-24 04:18:17,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:17,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709636311] [2019-11-24 04:18:17,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:17,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:18:17,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568476151] [2019-11-24 04:18:17,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:18:17,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:17,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:18:17,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:17,867 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2019-11-24 04:18:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:17,995 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-11-24 04:18:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:18:17,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-24 04:18:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:17,996 INFO L225 Difference]: With dead ends: 49 [2019-11-24 04:18:17,996 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:18:17,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:18:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:18:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:18:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:18:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:18:17,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-24 04:18:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:17,998 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:18:17,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:18:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:18:17,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:18:18,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:18:18,563 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,564 INFO L447 ceAbstractionStarter]: At program point L52(lines 10 53) the Hoare annotation is: true [2019-11-24 04:18:18,564 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,564 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:18:18,564 INFO L440 ceAbstractionStarter]: At program point L20-2(lines 20 51) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-24 04:18:18,564 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,565 INFO L440 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,565 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,565 INFO L440 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,565 INFO L444 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,565 INFO L440 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,566 INFO L444 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,566 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,566 INFO L440 ceAbstractionStarter]: At program point L4-11(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,566 INFO L444 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,566 INFO L440 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,566 INFO L444 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,567 INFO L440 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,567 INFO L440 ceAbstractionStarter]: At program point L21-2(lines 21 50) the Hoare annotation is: (and (or (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)) (<= 0 ULTIMATE.start_main_~j~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-24 04:18:18,567 INFO L444 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,567 INFO L440 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,567 INFO L444 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,567 INFO L440 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,568 INFO L444 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,568 INFO L440 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,568 INFO L444 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,568 INFO L440 ceAbstractionStarter]: At program point L4-29(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,568 INFO L444 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,568 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,569 INFO L444 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,569 INFO L440 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,569 INFO L444 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,569 INFO L444 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,569 INFO L444 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,569 INFO L444 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,569 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,570 INFO L440 ceAbstractionStarter]: At program point L4-35(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-24 04:18:18,570 INFO L444 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,570 INFO L444 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,570 INFO L444 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,570 INFO L444 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,570 INFO L440 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-24 04:18:18,570 INFO L444 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L440 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,571 INFO L440 ceAbstractionStarter]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-24 04:18:18,571 INFO L444 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L444 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L444 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L444 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L440 ceAbstractionStarter]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-24 04:18:18,572 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-24 04:18:18,572 INFO L440 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-24 04:18:18,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,574 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,574 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,574 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,574 INFO L444 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-24 04:18:18,574 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-24 04:18:18,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:18:18 BoogieIcfgContainer [2019-11-24 04:18:18,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:18:18,601 INFO L168 Benchmark]: Toolchain (without parser) took 3443.13 ms. Allocated memory was 144.7 MB in the beginning and 247.5 MB in the end (delta: 102.8 MB). Free memory was 102.4 MB in the beginning and 190.1 MB in the end (delta: -87.7 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:18,602 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-24 04:18:18,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.39 ms. Allocated memory is still 144.7 MB. Free memory was 102.2 MB in the beginning and 92.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:18,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.50 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 180.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:18,605 INFO L168 Benchmark]: Boogie Preprocessor took 34.92 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:18,606 INFO L168 Benchmark]: RCFGBuilder took 466.16 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 155.8 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:18,607 INFO L168 Benchmark]: TraceAbstraction took 2517.27 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 155.2 MB in the beginning and 190.1 MB in the end (delta: -34.9 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB. [2019-11-24 04:18:18,612 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.39 ms. Allocated memory is still 144.7 MB. Free memory was 102.2 MB in the beginning and 92.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 127.50 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 180.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.92 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.16 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 155.8 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2517.27 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 155.2 MB in the beginning and 190.1 MB in the end (delta: -34.9 MB). Peak memory consumption was 107.2 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 - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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 16 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((!(0 == cond) || i + 1 <= len) && 0 <= j) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 16 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 341 SDtfs, 308 SDslu, 147 SDs, 0 SdLazy, 338 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 46 NumberOfFragments, 430 HoareAnnotationTreeSize, 20 FomulaSimplifications, 4064 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 5168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...