java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/psyco/psyco_io_1_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:01:18,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:01:18,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:01:18,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:01:18,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:01:18,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:01:18,919 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:01:18,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:01:18,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:01:18,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:01:18,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:01:18,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:01:18,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:01:18,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:01:18,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:01:18,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:01:18,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:01:18,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:01:18,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:01:18,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:01:18,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:01:18,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:01:18,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:01:18,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:01:18,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:01:18,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:01:18,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:01:18,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:01:18,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:01:18,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:01:18,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:01:18,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:01:18,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:01:18,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:01:18,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:01:18,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:01:18,966 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:01:18,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:01:18,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:01:18,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:01:18,983 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:01:18,984 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:01:18,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:01:18,984 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:01:18,984 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:01:18,985 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:01:18,985 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:01:18,985 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:01:18,985 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:01:18,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:01:18,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:01:18,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:01:18,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:01:18,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:01:18,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:01:18,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:01:18,988 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:01:18,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:01:18,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:01:18,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:01:18,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:01:18,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:01:18,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:01:18,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:01:18,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:01:18,990 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:01:18,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:01:18,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:01:18,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:01:18,990 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:01:18,991 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:01:19,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:01:19,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:01:19,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:01:19,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:01:19,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:01:19,089 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_io_1_true-unreach-call_false-termination.c [2018-11-07 16:01:19,159 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cc717c/b5e25a34fe1a4bf08d8d31b31cc46294/FLAG0d6c24417 [2018-11-07 16:01:19,641 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:01:19,642 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_io_1_true-unreach-call_false-termination.c [2018-11-07 16:01:19,654 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cc717c/b5e25a34fe1a4bf08d8d31b31cc46294/FLAG0d6c24417 [2018-11-07 16:01:19,668 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cc717c/b5e25a34fe1a4bf08d8d31b31cc46294 [2018-11-07 16:01:19,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:01:19,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:01:19,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:01:19,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:01:19,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:01:19,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:19" (1/1) ... [2018-11-07 16:01:19,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67890395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:19, skipping insertion in model container [2018-11-07 16:01:19,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:19" (1/1) ... [2018-11-07 16:01:19,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:01:19,740 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:01:20,019 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:01:20,030 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:01:20,100 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:01:20,130 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:01:20,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20 WrapperNode [2018-11-07 16:01:20,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:01:20,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:01:20,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:01:20,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:01:20,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:01:20,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:01:20,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:01:20,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:01:20,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (1/1) ... [2018-11-07 16:01:20,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:01:20,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:01:20,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:01:20,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:01:20,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (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 16:01:20,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:01:20,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:01:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:01:20,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:01:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:01:20,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:01:21,203 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:01:21,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:21 BoogieIcfgContainer [2018-11-07 16:01:21,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:01:21,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:01:21,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:01:21,208 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:01:21,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:01:19" (1/3) ... [2018-11-07 16:01:21,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6719089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:21, skipping insertion in model container [2018-11-07 16:01:21,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:20" (2/3) ... [2018-11-07 16:01:21,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6719089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:21, skipping insertion in model container [2018-11-07 16:01:21,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:21" (3/3) ... [2018-11-07 16:01:21,212 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_io_1_true-unreach-call_false-termination.c [2018-11-07 16:01:21,223 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:01:21,232 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:01:21,251 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:01:21,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:01:21,288 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:01:21,288 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:01:21,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:01:21,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:01:21,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:01:21,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:01:21,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:01:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-11-07 16:01:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:01:21,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:01:21,322 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:01:21,325 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:01:21,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:01:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1125574581, now seen corresponding path program 1 times [2018-11-07 16:01:21,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:01:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:21,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:01:21,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:21,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:01:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:01:21,482 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 16:01:21,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:01:21,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:01:21,485 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:01:21,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:01:21,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:01:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:01:21,510 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2018-11-07 16:01:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:01:21,542 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2018-11-07 16:01:21,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:01:21,544 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-07 16:01:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:01:21,557 INFO L225 Difference]: With dead ends: 136 [2018-11-07 16:01:21,557 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 16:01:21,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:01:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 16:01:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-07 16:01:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 16:01:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2018-11-07 16:01:21,606 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 13 [2018-11-07 16:01:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:01:21,606 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2018-11-07 16:01:21,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:01:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2018-11-07 16:01:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 16:01:21,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:01:21,608 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:01:21,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:01:21,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:01:21,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1065567133, now seen corresponding path program 1 times [2018-11-07 16:01:21,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:01:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:21,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:01:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:21,610 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:01:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:01:21,674 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 16:01:21,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:01:21,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:01:21,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:01:21,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:01:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:01:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:21,678 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand 3 states. [2018-11-07 16:01:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:01:21,883 INFO L93 Difference]: Finished difference Result 119 states and 180 transitions. [2018-11-07 16:01:21,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:01:21,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 16:01:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:01:21,885 INFO L225 Difference]: With dead ends: 119 [2018-11-07 16:01:21,885 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 16:01:21,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 16:01:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-07 16:01:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 16:01:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-11-07 16:01:21,897 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 14 [2018-11-07 16:01:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:01:21,897 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-11-07 16:01:21,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:01:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-11-07 16:01:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:01:21,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:01:21,899 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:01:21,899 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:01:21,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:01:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash 353166488, now seen corresponding path program 1 times [2018-11-07 16:01:21,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:01:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:21,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:01:21,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:21,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:01:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:01:21,985 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 16:01:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:01:21,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:01:21,985 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:01:21,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:01:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:01:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:21,987 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-11-07 16:01:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:01:22,116 INFO L93 Difference]: Finished difference Result 113 states and 169 transitions. [2018-11-07 16:01:22,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:01:22,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-07 16:01:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:01:22,118 INFO L225 Difference]: With dead ends: 113 [2018-11-07 16:01:22,119 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 16:01:22,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 16:01:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-07 16:01:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 16:01:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2018-11-07 16:01:22,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 19 [2018-11-07 16:01:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:01:22,129 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2018-11-07 16:01:22,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:01:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2018-11-07 16:01:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 16:01:22,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:01:22,130 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:01:22,131 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:01:22,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:01:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1779075192, now seen corresponding path program 1 times [2018-11-07 16:01:22,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:01:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:01:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:01:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:01:22,203 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 16:01:22,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:01:22,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:01:22,204 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:01:22,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:01:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:01:22,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:22,205 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand 3 states. [2018-11-07 16:01:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:01:22,403 INFO L93 Difference]: Finished difference Result 140 states and 210 transitions. [2018-11-07 16:01:22,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:01:22,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-07 16:01:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:01:22,409 INFO L225 Difference]: With dead ends: 140 [2018-11-07 16:01:22,409 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 16:01:22,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 16:01:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-11-07 16:01:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 16:01:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2018-11-07 16:01:22,432 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 24 [2018-11-07 16:01:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:01:22,432 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2018-11-07 16:01:22,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:01:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2018-11-07 16:01:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 16:01:22,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:01:22,438 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:01:22,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:01:22,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:01:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1346518875, now seen corresponding path program 1 times [2018-11-07 16:01:22,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:01:22,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:01:22,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:01:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:01:22,513 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 16:01:22,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:01:22,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:01:22,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:01:22,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:01:22,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:01:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:22,515 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand 3 states. [2018-11-07 16:01:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:01:22,683 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2018-11-07 16:01:22,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:01:22,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-07 16:01:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:01:22,686 INFO L225 Difference]: With dead ends: 180 [2018-11-07 16:01:22,687 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 16:01:22,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 16:01:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-07 16:01:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 16:01:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2018-11-07 16:01:22,698 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 25 [2018-11-07 16:01:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:01:22,698 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-11-07 16:01:22,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:01:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2018-11-07 16:01:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 16:01:22,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:01:22,700 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:01:22,701 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:01:22,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:01:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1918843288, now seen corresponding path program 1 times [2018-11-07 16:01:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:01:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:01:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:01:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:01:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:01:22,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:01:22,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:01:22,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:01:22,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:01:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:01:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:22,770 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand 3 states. [2018-11-07 16:01:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:01:22,819 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2018-11-07 16:01:22,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:01:22,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-07 16:01:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:01:22,821 INFO L225 Difference]: With dead ends: 164 [2018-11-07 16:01:22,821 INFO L226 Difference]: Without dead ends: 77 [2018-11-07 16:01:22,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:01:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-07 16:01:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-07 16:01:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 16:01:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2018-11-07 16:01:22,830 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 36 [2018-11-07 16:01:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:01:22,831 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2018-11-07 16:01:22,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:01:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2018-11-07 16:01:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 16:01:22,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:01:22,833 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:01:22,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:01:22,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:01:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1384362555, now seen corresponding path program 1 times [2018-11-07 16:01:22,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:01:22,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:01:22,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:01:22,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:01:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:01:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 16:01:22,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:01:22,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 16:01:22,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:01:22,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:01:22,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:01:22,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:01:22,961 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 4 states. [2018-11-07 16:01:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:01:23,076 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2018-11-07 16:01:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:01:23,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-07 16:01:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:01:23,078 INFO L225 Difference]: With dead ends: 80 [2018-11-07 16:01:23,079 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:01:23,080 INFO L604 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 [2018-11-07 16:01:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:01:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:01:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:01:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:01:23,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-07 16:01:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:01:23,081 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:01:23,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:01:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:01:23,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:01:23,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:01:23,550 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-11-07 16:01:23,562 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:01:23,562 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:01:23,563 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:01:23,563 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:01:23,563 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:01:23,563 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:01:23,563 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:01:23,563 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 344) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2018-11-07 16:01:23,564 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2018-11-07 16:01:23,567 INFO L421 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= main_~q~0 2) .cse0) (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2018-11-07 16:01:23,567 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2018-11-07 16:01:23,567 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 344) no Hoare annotation was computed. [2018-11-07 16:01:23,567 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2018-11-07 16:01:23,567 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2018-11-07 16:01:23,568 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L421 ceAbstractionStarter]: At program point L23-3(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L23-4(lines 23 339) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2018-11-07 16:01:23,569 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2018-11-07 16:01:23,570 INFO L425 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2018-11-07 16:01:23,570 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2018-11-07 16:01:23,570 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2018-11-07 16:01:23,570 INFO L425 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2018-11-07 16:01:23,570 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2018-11-07 16:01:23,571 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2018-11-07 16:01:23,571 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2018-11-07 16:01:23,571 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2018-11-07 16:01:23,571 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2018-11-07 16:01:23,571 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2018-11-07 16:01:23,571 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2018-11-07 16:01:23,572 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2018-11-07 16:01:23,572 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2018-11-07 16:01:23,572 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2018-11-07 16:01:23,572 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-11-07 16:01:23,572 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2018-11-07 16:01:23,572 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-07 16:01:23,572 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-07 16:01:23,573 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-11-07 16:01:23,573 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2018-11-07 16:01:23,573 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2018-11-07 16:01:23,573 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2018-11-07 16:01:23,573 INFO L421 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2018-11-07 16:01:23,573 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-11-07 16:01:23,573 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2018-11-07 16:01:23,574 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2018-11-07 16:01:23,574 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2018-11-07 16:01:23,574 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2018-11-07 16:01:23,574 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2018-11-07 16:01:23,574 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2018-11-07 16:01:23,574 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2018-11-07 16:01:23,575 INFO L425 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2018-11-07 16:01:23,575 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 344) the Hoare annotation is: true [2018-11-07 16:01:23,575 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2018-11-07 16:01:23,575 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2018-11-07 16:01:23,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:01:23 BoogieIcfgContainer [2018-11-07 16:01:23,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:01:23,593 INFO L168 Benchmark]: Toolchain (without parser) took 3913.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -642.7 MB). Peak memory consumption was 87.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:01:23,595 INFO L168 Benchmark]: CDTParser took 0.25 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 16:01:23,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.17 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-07 16:01:23,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.74 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 16:01:23,597 INFO L168 Benchmark]: Boogie Preprocessor took 69.29 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 16:01:23,598 INFO L168 Benchmark]: RCFGBuilder took 963.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:01:23,599 INFO L168 Benchmark]: TraceAbstraction took 2387.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. [2018-11-07 16:01:23,607 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.25 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 450.17 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.74 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 69.29 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 963.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2387.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: (q == 0 && this_sink == 0) || (3 <= q && !(this_sink == 0)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((q == 2 && this_sink == 0) || (q == 0 && this_sink == 0)) || (3 <= q && !(this_sink == 0)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 549 SDtfs, 190 SDslu, 291 SDs, 0 SdLazy, 87 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 44 HoareAnnotationTreeSize, 7 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 6831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...