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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1_alt.BV.c.cil.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:27:57,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:57,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:57,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:57,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:57,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:57,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:57,921 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:57,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:57,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:57,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:57,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:57,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:57,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:57,928 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:57,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:57,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:57,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:57,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:57,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:57,944 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:57,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:57,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:57,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:57,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:57,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:57,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:57,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:57,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:57,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:57,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:57,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:57,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:57,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:57,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:57,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:57,966 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:27:57,981 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:57,981 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:57,982 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:57,982 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:57,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:57,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:57,983 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:57,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:57,984 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:57,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:57,984 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:57,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:57,985 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:57,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:57,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:57,985 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:57,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:57,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:57,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:57,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:57,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:57,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:57,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:57,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:57,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:57,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:57,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:57,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:57,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:57,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:58,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:58,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:58,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:58,067 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:58,068 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:58,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1_alt.BV.c.cil.c_14.bpl [2018-10-04 12:27:58,069 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1_alt.BV.c.cil.c_14.bpl' [2018-10-04 12:27:58,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:58,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:58,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:58,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:58,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:58,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:58,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:58,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:58,239 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:58,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/1) ... [2018-10-04 12:27:58,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:58,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:58,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:58,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:58,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (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-10-04 12:27:58,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:58,957 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:58,957 INFO L202 PluginConnector]: Adding new model s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:58 BoogieIcfgContainer [2018-10-04 12:27:58,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:58,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:58,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:58,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:58,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:58" (1/2) ... [2018-10-04 12:27:58,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf38e8c and model type s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:27:58, skipping insertion in model container [2018-10-04 12:27:58,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:58" (2/2) ... [2018-10-04 12:27:58,965 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1_alt.BV.c.cil.c_14.bpl [2018-10-04 12:27:58,975 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:58,986 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:59,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:59,035 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:59,035 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:59,036 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:59,036 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:59,036 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:59,036 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:59,036 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:59,036 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-10-04 12:27:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:27:59,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:59,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:59,058 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:59,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:59,064 INFO L82 PathProgramCache]: Analyzing trace with hash -839018561, now seen corresponding path program 1 times [2018-10-04 12:27:59,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:59,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:59,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:59,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:59,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:59,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:59,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:59,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:59,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:59,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:59,328 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-10-04 12:27:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:59,614 INFO L93 Difference]: Finished difference Result 39 states and 65 transitions. [2018-10-04 12:27:59,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:59,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-04 12:27:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:59,628 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:27:59,628 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:27:59,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-04 12:27:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:27:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:27:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:27:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-10-04 12:27:59,674 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 11 [2018-10-04 12:27:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:59,674 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2018-10-04 12:27:59,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2018-10-04 12:27:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:27:59,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:59,676 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:59,676 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:59,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash -447746379, now seen corresponding path program 1 times [2018-10-04 12:27:59,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:59,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:59,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:59,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:59,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:59,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:59,785 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 3 states. [2018-10-04 12:28:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:00,014 INFO L93 Difference]: Finished difference Result 57 states and 93 transitions. [2018-10-04 12:28:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:00,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 12:28:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:00,016 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:28:00,016 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:28:00,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-04 12:28:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:28:00,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:28:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:28:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2018-10-04 12:28:00,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 19 [2018-10-04 12:28:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:00,027 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2018-10-04 12:28:00,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2018-10-04 12:28:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:28:00,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:00,029 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:00,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:00,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:00,032 INFO L82 PathProgramCache]: Analyzing trace with hash -180362168, now seen corresponding path program 1 times [2018-10-04 12:28:00,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:00,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,076 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 12:28:00,076 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 12:28:00,076 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-04 12:28:00,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:00,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:00,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:00,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:00,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:00,206 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 3 states. [2018-10-04 12:28:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:00,340 INFO L93 Difference]: Finished difference Result 95 states and 156 transitions. [2018-10-04 12:28:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:00,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 12:28:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:00,343 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:28:00,345 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:28:00,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-10-04 12:28:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:28:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-10-04 12:28:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:28:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2018-10-04 12:28:00,375 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 82 transitions. Word has length 23 [2018-10-04 12:28:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:00,375 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 82 transitions. [2018-10-04 12:28:00,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 82 transitions. [2018-10-04 12:28:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:28:00,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:00,379 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:00,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:00,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash 149509616, now seen corresponding path program 1 times [2018-10-04 12:28:00,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:00,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:00,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:00,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:28:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:00,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:00,486 INFO L87 Difference]: Start difference. First operand 53 states and 82 transitions. Second operand 3 states. [2018-10-04 12:28:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:00,644 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2018-10-04 12:28:00,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:00,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 12:28:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:00,647 INFO L225 Difference]: With dead ends: 89 [2018-10-04 12:28:00,647 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:28:00,648 INFO L605 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-10-04 12:28:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:28:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 12:28:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:28:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2018-10-04 12:28:00,660 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 26 [2018-10-04 12:28:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:00,660 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2018-10-04 12:28:00,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2018-10-04 12:28:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:28:00,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:00,662 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:00,662 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:00,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash 370316658, now seen corresponding path program 1 times [2018-10-04 12:28:00,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 12:28:00,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:00,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:00,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:00,745 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand 3 states. [2018-10-04 12:28:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:00,879 INFO L93 Difference]: Finished difference Result 98 states and 150 transitions. [2018-10-04 12:28:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:00,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:28:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:00,882 INFO L225 Difference]: With dead ends: 98 [2018-10-04 12:28:00,882 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:28:00,883 INFO L605 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-10-04 12:28:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:28:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 12:28:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 12:28:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2018-10-04 12:28:00,906 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 30 [2018-10-04 12:28:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:00,906 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2018-10-04 12:28:00,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2018-10-04 12:28:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 12:28:00,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:00,908 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:00,908 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:00,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1626235776, now seen corresponding path program 1 times [2018-10-04 12:28:00,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:00,947 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 12:28:00,947 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 12:28:00,947 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-04 12:28:00,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:01,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 12:28:01,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:01,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:01,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:01,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:01,118 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2018-10-04 12:28:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:01,410 INFO L93 Difference]: Finished difference Result 135 states and 200 transitions. [2018-10-04 12:28:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:01,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-04 12:28:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:01,412 INFO L225 Difference]: With dead ends: 135 [2018-10-04 12:28:01,412 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:28:01,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-10-04 12:28:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:28:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 12:28:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:28:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2018-10-04 12:28:01,425 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 35 [2018-10-04 12:28:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:01,425 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2018-10-04 12:28:01,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2018-10-04 12:28:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:28:01,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:01,427 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:01,428 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:01,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash -656795076, now seen corresponding path program 1 times [2018-10-04 12:28:01,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:01,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:01,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:01,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:01,447 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 12:28:01,447 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 12:28:01,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-04 12:28:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:01,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 12:28:01,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:01,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:01,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:01,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:01,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:01,624 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand 3 states. [2018-10-04 12:28:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:01,849 INFO L93 Difference]: Finished difference Result 160 states and 227 transitions. [2018-10-04 12:28:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:01,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 12:28:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:01,853 INFO L225 Difference]: With dead ends: 160 [2018-10-04 12:28:01,853 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 12:28:01,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-10-04 12:28:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 12:28:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 12:28:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 12:28:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2018-10-04 12:28:01,871 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 41 [2018-10-04 12:28:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:01,872 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2018-10-04 12:28:01,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2018-10-04 12:28:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:28:01,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:01,875 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:01,875 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:01,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:01,876 INFO L82 PathProgramCache]: Analyzing trace with hash 105768157, now seen corresponding path program 1 times [2018-10-04 12:28:01,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:01,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:01,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:01,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:01,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:28:01,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:01,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-04 12:28:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:02,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 12:28:02,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:28:02,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:28:02,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:28:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:28:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:02,212 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand 5 states. [2018-10-04 12:28:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:02,426 INFO L93 Difference]: Finished difference Result 189 states and 238 transitions. [2018-10-04 12:28:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:28:02,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-04 12:28:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:02,427 INFO L225 Difference]: With dead ends: 189 [2018-10-04 12:28:02,427 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:28:02,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:28:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:28:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:28:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:28:02,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-10-04 12:28:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:02,429 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:28:02,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:28:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:28:02,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:28:02,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:28:02,772 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-10-04 12:28:03,097 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-10-04 12:28:03,550 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-10-04 12:28:03,617 INFO L421 ceAbstractionStarter]: At program point L271(lines 234 271) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8528) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8512) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8496) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8544)))) [2018-10-04 12:28:03,618 INFO L421 ceAbstractionStarter]: At program point L267(lines 267 286) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8528) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8512) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8496) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8544)))) [2018-10-04 12:28:03,618 INFO L421 ceAbstractionStarter]: At program point L362(lines 362 378) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-10-04 12:28:03,618 INFO L421 ceAbstractionStarter]: At program point L424(lines 262 424) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8528) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8512) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8496) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8544)))) [2018-10-04 12:28:03,619 INFO L421 ceAbstractionStarter]: At program point L321(lines 321 338) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8544)))) [2018-10-04 12:28:03,619 INFO L421 ceAbstractionStarter]: At program point L416(lines 410 416) the Hoare annotation is: false [2018-10-04 12:28:03,619 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 425) no Hoare annotation was computed. [2018-10-04 12:28:03,619 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 425) no Hoare annotation was computed. [2018-10-04 12:28:03,619 INFO L421 ceAbstractionStarter]: At program point L247(lines 247 263) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8528) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8512) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8496) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8544)))) [2018-10-04 12:28:03,620 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 415) no Hoare annotation was computed. [2018-10-04 12:28:03,620 INFO L421 ceAbstractionStarter]: At program point L404(lines 404 414) the Hoare annotation is: false [2018-10-04 12:28:03,620 INFO L421 ceAbstractionStarter]: At program point L289(lines 289 299) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8528) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8512) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8544)))) [2018-10-04 12:28:03,620 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 425) no Hoare annotation was computed. [2018-10-04 12:28:03,620 INFO L421 ceAbstractionStarter]: At program point L343(lines 343 354) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)))) [2018-10-04 12:28:03,620 INFO L421 ceAbstractionStarter]: At program point L302(lines 302 318) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~6 8528) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8544)))) [2018-10-04 12:28:03,620 INFO L421 ceAbstractionStarter]: At program point L381(lines 381 395) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 0)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-10-04 12:28:03,621 INFO L421 ceAbstractionStarter]: At program point L394(lines 394 411) the Hoare annotation is: false [2018-10-04 12:28:03,635 INFO L202 PluginConnector]: Adding new model s3_srvr_1_alt.BV.c.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:28:03 BoogieIcfgContainer [2018-10-04 12:28:03,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:28:03,636 INFO L168 Benchmark]: Toolchain (without parser) took 5442.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 362.2 MB). Peak memory consumption was 362.2 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:03,637 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-10-04 12:28:03,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.46 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-10-04 12:28:03,638 INFO L168 Benchmark]: Boogie Preprocessor took 55.68 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-10-04 12:28:03,639 INFO L168 Benchmark]: RCFGBuilder took 662.58 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:03,640 INFO L168 Benchmark]: TraceAbstraction took 4676.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.5 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:03,644 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 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 Procedure Inliner took 42.46 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 55.68 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 662.58 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4676.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.5 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 415]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__state~6 == 8528 && ssl3_accept_~blastFlag~6 <= 2) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8512 && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8496 && ssl3_accept_~blastFlag~6 <= 2)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0)) || (ssl3_accept_~blastFlag~6 <= 2 && ssl3_accept_~s__state~6 == 8544) - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0)) || (ssl3_accept_~blastFlag~6 <= 2 && ssl3_accept_~s__state~6 == 8544) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~s__state~6 == 8528 && ssl3_accept_~blastFlag~6 <= 2) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8512 && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8496 && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~blastFlag~6 <= 2 && ssl3_accept_~s__state~6 == 8544) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__state~6 == 8528 && ssl3_accept_~blastFlag~6 <= 2) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8512 && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8496 && ssl3_accept_~blastFlag~6 <= 2)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0)) || (ssl3_accept_~blastFlag~6 <= 2 && ssl3_accept_~s__state~6 == 8544) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~s__state~6 == 8528 && ssl3_accept_~blastFlag~6 <= 2) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8512 && ssl3_accept_~blastFlag~6 <= 2)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0)) || (ssl3_accept_~blastFlag~6 <= 2 && ssl3_accept_~s__state~6 == 8544) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__state~6 == 8528 && ssl3_accept_~blastFlag~6 <= 2) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8512 && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__state~6 == 8496 && ssl3_accept_~blastFlag~6 <= 2)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0)) || (ssl3_accept_~blastFlag~6 <= 2 && ssl3_accept_~s__state~6 == 8544) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((ssl3_accept_~s__state~6 == 8528 && ssl3_accept_~blastFlag~6 <= 2) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 2)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && ssl3_accept_~blastFlag~6 <= 0)) || (ssl3_accept_~blastFlag~6 <= 2 && ssl3_accept_~s__state~6 == 8544) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 21 SDslu, 36 SDs, 0 SdLazy, 193 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 122 NumberOfFragments, 374 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1459 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 297 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 16018 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 333/341 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1_alt.BV.c.cil.c_14.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-28-03-660.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1_alt.BV.c.cil.c_14.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-28-03-660.csv Received shutdown request...