java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:27:56,845 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:27:56,847 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:27:56,865 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:27:56,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:27:56,868 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:27:56,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:27:56,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:27:56,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:27:56,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:27:56,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:27:56,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:27:56,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:27:56,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:27:56,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:27:56,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:27:56,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:27:56,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:27:56,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:27:56,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:27:56,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:27:56,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:27:56,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:27:56,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:27:56,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:27:56,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:27:56,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:27:56,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:27:56,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:27:56,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:27:56,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:27:56,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:27:56,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:27:56,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:27:56,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:27:56,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:27:56,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:27:56,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:27:56,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:27:56,957 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:27:56,958 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:27:56,958 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:27:56,958 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:27:56,959 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:27:56,959 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:27:56,959 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:27:56,959 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:27:56,959 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:27:56,960 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:27:56,960 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:27:56,960 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:27:56,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:27:56,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:27:56,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:27:56,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:27:56,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:27:56,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:27:56,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:27:56,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:27:56,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:27:56,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:27:56,965 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:27:56,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:27:56,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:27:56,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:27:56,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:27:56,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:27:56,966 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:27:56,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:27:56,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:27:56,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:27:56,967 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:27:56,968 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:27:57,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:27:57,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:27:57,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:27:57,060 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:27:57,061 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:27:57,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-11-07 10:27:57,130 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2335a0a9/9d58471e85eb47ada395daae106bdc6d/FLAGdb571b661 [2018-11-07 10:27:57,628 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:27:57,629 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-11-07 10:27:57,637 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2335a0a9/9d58471e85eb47ada395daae106bdc6d/FLAGdb571b661 [2018-11-07 10:27:57,651 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2335a0a9/9d58471e85eb47ada395daae106bdc6d [2018-11-07 10:27:57,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:27:57,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:27:57,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:27:57,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:27:57,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:27:57,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:57,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a715eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57, skipping insertion in model container [2018-11-07 10:27:57,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:57,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:27:57,707 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:27:57,910 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:27:57,915 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:27:57,943 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:27:57,966 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:27:57,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57 WrapperNode [2018-11-07 10:27:57,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:27:57,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:27:57,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:27:57,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:27:57,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:57,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:57,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:27:57,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:27:57,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:27:57,998 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:27:58,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:58,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:58,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:58,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:58,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:58,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:58,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... [2018-11-07 10:27:58,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:27:58,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:27:58,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:27:58,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:27:58,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:27:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:27:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:27:58,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:27:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:27:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:27:58,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:27:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:27:58,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:27:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:27:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:27:58,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:27:58,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:27:58,788 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:27:58,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:27:58 BoogieIcfgContainer [2018-11-07 10:27:58,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:27:58,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:27:58,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:27:58,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:27:58,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:27:57" (1/3) ... [2018-11-07 10:27:58,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b77ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:27:58, skipping insertion in model container [2018-11-07 10:27:58,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:27:57" (2/3) ... [2018-11-07 10:27:58,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b77ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:27:58, skipping insertion in model container [2018-11-07 10:27:58,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:27:58" (3/3) ... [2018-11-07 10:27:58,799 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-11-07 10:27:58,809 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:27:58,817 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:27:58,832 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:27:58,869 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:27:58,869 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:27:58,869 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:27:58,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:27:58,870 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:27:58,870 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:27:58,870 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:27:58,870 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:27:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-07 10:27:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 10:27:58,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:58,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:58,904 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:58,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 308783607, now seen corresponding path program 1 times [2018-11-07 10:27:58,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:58,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:58,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:58,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:59,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:27:59,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:27:59,063 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:59,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:27:59,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:27:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:27:59,088 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-07 10:27:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:59,119 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2018-11-07 10:27:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:27:59,120 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-07 10:27:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:59,129 INFO L225 Difference]: With dead ends: 115 [2018-11-07 10:27:59,129 INFO L226 Difference]: Without dead ends: 41 [2018-11-07 10:27:59,134 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 10:27:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-07 10:27:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-07 10:27:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 10:27:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-07 10:27:59,174 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 24 [2018-11-07 10:27:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:59,175 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-07 10:27:59,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:27:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-07 10:27:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 10:27:59,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:59,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:59,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:59,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -598303112, now seen corresponding path program 1 times [2018-11-07 10:27:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:59,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:27:59,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:27:59,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:27:59,277 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:59,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:27:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:27:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:27:59,280 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-11-07 10:27:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:59,486 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-11-07 10:27:59,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:27:59,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-07 10:27:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:59,490 INFO L225 Difference]: With dead ends: 86 [2018-11-07 10:27:59,490 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:27:59,491 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 10:27:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:27:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-11-07 10:27:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 10:27:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-07 10:27:59,501 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 31 [2018-11-07 10:27:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:59,501 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-07 10:27:59,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:27:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-07 10:27:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:27:59,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:59,503 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:59,504 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:59,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1546214901, now seen corresponding path program 1 times [2018-11-07 10:27:59,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:59,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:59,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:27:59,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:59,662 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:59,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-07 10:27:59,665 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [20], [24], [32], [36], [39], [41], [42], [43], [45], [49], [57], [61], [63], [66], [72], [76], [78], [81], [94], [98], [102], [116], [124], [127], [129], [135], [136], [137], [139] [2018-11-07 10:27:59,705 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:27:59,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:28:00,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:28:00,008 INFO L272 AbstractInterpreter]: Visited 39 different actions 63 times. Merged at 10 different actions 20 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-11-07 10:28:00,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:00,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:28:00,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:00,023 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:00,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:00,039 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:28:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:00,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:28:00,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:28:00,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:00,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 10:28:00,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:00,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:28:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:28:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:28:00,250 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 5 states. [2018-11-07 10:28:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:00,527 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2018-11-07 10:28:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:28:00,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-07 10:28:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:00,529 INFO L225 Difference]: With dead ends: 105 [2018-11-07 10:28:00,529 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 10:28:00,530 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 10:28:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 10:28:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2018-11-07 10:28:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 10:28:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-07 10:28:00,540 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 41 [2018-11-07 10:28:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:00,540 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-07 10:28:00,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:28:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-07 10:28:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 10:28:00,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:00,542 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:00,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:00,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -687417832, now seen corresponding path program 2 times [2018-11-07 10:28:00,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:00,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:00,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:00,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:28:00,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:00,657 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:00,657 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:00,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:00,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:00,658 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:00,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:28:00,673 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:28:00,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 10:28:00,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:00,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 10:28:00,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 10:28:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:28:00,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [5] total 13 [2018-11-07 10:28:00,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:28:00,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:28:00,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:28:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:28:01,000 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 7 states. [2018-11-07 10:28:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:01,427 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-07 10:28:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:28:01,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-07 10:28:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:01,431 INFO L225 Difference]: With dead ends: 76 [2018-11-07 10:28:01,431 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:28:01,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:28:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:28:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-07 10:28:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 10:28:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-07 10:28:01,439 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 51 [2018-11-07 10:28:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:01,440 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-07 10:28:01,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:28:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-11-07 10:28:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 10:28:01,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:01,442 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:01,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:01,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1339519265, now seen corresponding path program 1 times [2018-11-07 10:28:01,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:01,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:01,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:01,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:28:01,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:01,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:01,537 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-11-07 10:28:01,537 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [20], [24], [32], [36], [39], [41], [42], [43], [45], [49], [57], [61], [63], [66], [72], [76], [78], [81], [83], [94], [98], [102], [116], [124], [127], [129], [135], [136], [137], [139] [2018-11-07 10:28:01,540 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:28:01,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:28:01,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:28:01,700 INFO L272 AbstractInterpreter]: Visited 40 different actions 88 times. Merged at 18 different actions 36 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 10:28:01,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:01,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:28:01,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:01,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:01,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:01,748 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:28:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:01,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:28:01,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 10:28:01,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:01,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 10:28:01,985 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:01,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:28:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:28:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:28:01,988 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 6 states. [2018-11-07 10:28:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:02,195 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-07 10:28:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:28:02,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-07 10:28:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:02,197 INFO L225 Difference]: With dead ends: 133 [2018-11-07 10:28:02,197 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 10:28:02,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:28:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 10:28:02,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2018-11-07 10:28:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 10:28:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-11-07 10:28:02,210 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 54 [2018-11-07 10:28:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:02,211 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-11-07 10:28:02,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:28:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-11-07 10:28:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 10:28:02,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:02,213 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:28:02,213 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:02,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:02,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1995533694, now seen corresponding path program 2 times [2018-11-07 10:28:02,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:02,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:02,215 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:28:02,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:02,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:02,326 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:02,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:02,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:02,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:02,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:28:02,336 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:28:02,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 10:28:02,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:02,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:28:02,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:28:02,514 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:28:02,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2018-11-07 10:28:02,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:28:02,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:28:02,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:28:02,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:28:02,515 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 5 states. [2018-11-07 10:28:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:02,591 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-07 10:28:02,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:28:02,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-07 10:28:02,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:02,592 INFO L225 Difference]: With dead ends: 68 [2018-11-07 10:28:02,592 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:28:02,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:28:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:28:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:28:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:28:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:28:02,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-11-07 10:28:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:02,594 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:28:02,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:28:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:28:02,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:28:02,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:28:02,756 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:28:02,756 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:28:02,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:28:02,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:28:02,757 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:28:02,757 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:28:02,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:28:02,757 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-11-07 10:28:02,758 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2018-11-07 10:28:02,758 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 20) no Hoare annotation was computed. [2018-11-07 10:28:02,758 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 20) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-07 10:28:02,758 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 20) no Hoare annotation was computed. [2018-11-07 10:28:02,758 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-11-07 10:28:02,758 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 29) no Hoare annotation was computed. [2018-11-07 10:28:02,759 INFO L421 ceAbstractionStarter]: At program point L28-4(lines 28 29) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-07 10:28:02,759 INFO L425 ceAbstractionStarter]: For program point L28-5(lines 28 29) no Hoare annotation was computed. [2018-11-07 10:28:02,759 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-07 10:28:02,759 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-07 10:28:02,759 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-07 10:28:02,759 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-11-07 10:28:02,759 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-11-07 10:28:02,760 INFO L421 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-07 10:28:02,760 INFO L425 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-11-07 10:28:02,760 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 51) no Hoare annotation was computed. [2018-11-07 10:28:02,760 INFO L425 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2018-11-07 10:28:02,760 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. [2018-11-07 10:28:02,760 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 24) no Hoare annotation was computed. [2018-11-07 10:28:02,761 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 24) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-07 10:28:02,761 INFO L425 ceAbstractionStarter]: For program point L23-5(lines 23 24) no Hoare annotation was computed. [2018-11-07 10:28:02,761 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-11-07 10:28:02,761 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2018-11-07 10:28:02,761 INFO L421 ceAbstractionStarter]: At program point L32-4(lines 32 33) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-07 10:28:02,762 INFO L425 ceAbstractionStarter]: For program point L32-5(lines 15 58) no Hoare annotation was computed. [2018-11-07 10:28:02,762 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-07 10:28:02,762 INFO L425 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-11-07 10:28:02,762 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,762 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,762 INFO L425 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,763 INFO L425 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,763 INFO L425 ceAbstractionStarter]: For program point L16-4(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,763 INFO L425 ceAbstractionStarter]: For program point L16-5(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,763 INFO L425 ceAbstractionStarter]: For program point L16-6(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,763 INFO L425 ceAbstractionStarter]: For program point L16-7(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,763 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-07 10:28:02,763 INFO L425 ceAbstractionStarter]: For program point L16-8(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,764 INFO L425 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-11-07 10:28:02,764 INFO L425 ceAbstractionStarter]: For program point L16-9(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,764 INFO L425 ceAbstractionStarter]: For program point L41-2(lines 41 50) no Hoare annotation was computed. [2018-11-07 10:28:02,764 INFO L425 ceAbstractionStarter]: For program point L16-10(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,764 INFO L425 ceAbstractionStarter]: For program point L16-11(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,764 INFO L421 ceAbstractionStarter]: At program point L41-4(lines 39 51) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0) (and (<= 0 main_~j~0) (<= main_~nc_B~0 0))) [2018-11-07 10:28:02,765 INFO L425 ceAbstractionStarter]: For program point L16-12(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,765 INFO L425 ceAbstractionStarter]: For program point L16-13(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,765 INFO L425 ceAbstractionStarter]: For program point L16-14(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,765 INFO L425 ceAbstractionStarter]: For program point L16-15(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,765 INFO L425 ceAbstractionStarter]: For program point L16-16(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,765 INFO L425 ceAbstractionStarter]: For program point L16-17(line 16) no Hoare annotation was computed. [2018-11-07 10:28:02,765 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 10:28:02,766 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-07 10:28:02,766 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-07 10:28:02,766 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-07 10:28:02,766 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-07 10:28:02,766 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-07 10:28:02,766 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-07 10:28:02,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:28:02 BoogieIcfgContainer [2018-11-07 10:28:02,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:28:02,784 INFO L168 Benchmark]: Toolchain (without parser) took 5121.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -473.6 MB). Peak memory consumption was 263.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:28:02,786 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:28:02,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:28:02,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:28:02,788 INFO L168 Benchmark]: Boogie Preprocessor took 50.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:28:02,788 INFO L168 Benchmark]: RCFGBuilder took 739.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:28:02,789 INFO L168 Benchmark]: TraceAbstraction took 3991.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 281.0 MB). Peak memory consumption was 281.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:28:02,794 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.23 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 302.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.77 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 50.88 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 739.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3991.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 281.0 MB). Peak memory consumption was 281.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (0 == found || 1 == found) || (0 <= j && nc_B <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 137 SDslu, 464 SDs, 0 SdLazy, 164 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 31 NumberOfFragments, 54 HoareAnnotationTreeSize, 17 FomulaSimplifications, 87 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 475 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 671 ConstructedInterpolants, 0 QuantifiedInterpolants, 46607 SizeOfPredicates, 12 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 201/264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...