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_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:31:32,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:31:32,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:31:32,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:31:32,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:31:32,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:31:32,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:31:32,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:31:32,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:31:32,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:31:32,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:31:32,857 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:31:32,858 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:31:32,859 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:31:32,860 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:31:32,861 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:31:32,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:31:32,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:31:32,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:31:32,867 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:31:32,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:31:32,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:31:32,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:31:32,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:31:32,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:31:32,873 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:31:32,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:31:32,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:31:32,875 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:31:32,876 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:31:32,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:31:32,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:31:32,878 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:31:32,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:31:32,879 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:31:32,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:31:32,880 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-09-23 21:31:32,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:31:32,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:31:32,911 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:31:32,911 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:31:32,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:31:32,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:31:32,913 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:31:32,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:31:32,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:31:32,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:31:32,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:31:32,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:31:32,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:31:32,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:31:32,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:31:32,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:31:32,916 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:31:32,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:31:32,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:31:32,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:31:32,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:31:32,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:31:32,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:31:32,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:31:32,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:31:32,919 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:31:32,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:31:32,919 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:31:32,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:31:32,919 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:31:32,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:31:33,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:31:33,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:31:33,011 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:31:33,012 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:31:33,013 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-09-23 21:31:33,013 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-09-23 21:31:33,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:31:33,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:31:33,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:31:33,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:31:33,116 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:31:33,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:31:33,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:31:33,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:31:33,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:31:33,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/1) ... [2018-09-23 21:31:33,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:31:33,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:31:33,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:31:33,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:31:33,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (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-09-23 21:31:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 21:31:33,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 21:31:33,869 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 21:31:33,869 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:31:33 BoogieIcfgContainer [2018-09-23 21:31:33,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:31:33,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:31:33,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:31:33,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:31:33,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:31:33" (1/2) ... [2018-09-23 21:31:33,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4752dee4 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:31:33, skipping insertion in model container [2018-09-23 21:31:33,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:31:33" (2/2) ... [2018-09-23 21:31:33,883 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-09-23 21:31:33,893 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:31:33,907 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 21:31:33,959 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:31:33,960 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:31:33,960 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:31:33,961 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:31:33,961 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:31:33,961 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:31:33,961 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:31:33,961 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:31:33,962 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:31:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-23 21:31:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-23 21:31:33,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:33,995 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:33,996 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:34,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:34,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-09-23 21:31:34,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:34,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:34,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:34,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:31:34,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:34,209 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-23 21:31:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:34,438 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-09-23 21:31:34,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:34,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-23 21:31:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:34,459 INFO L225 Difference]: With dead ends: 37 [2018-09-23 21:31:34,459 INFO L226 Difference]: Without dead ends: 20 [2018-09-23 21:31:34,466 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-09-23 21:31:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-23 21:31:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-23 21:31:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-23 21:31:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-09-23 21:31:34,511 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-09-23 21:31:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:34,511 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-09-23 21:31:34,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-09-23 21:31:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 21:31:34,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:34,512 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:34,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:34,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:34,513 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-09-23 21:31:34,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:34,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:34,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:34,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:34,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:31:34,627 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:34,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:34,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:34,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:34,630 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-09-23 21:31:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:34,912 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-09-23 21:31:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:34,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-23 21:31:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:34,914 INFO L225 Difference]: With dead ends: 41 [2018-09-23 21:31:34,914 INFO L226 Difference]: Without dead ends: 24 [2018-09-23 21:31:34,915 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-09-23 21:31:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-23 21:31:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-23 21:31:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-23 21:31:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-09-23 21:31:34,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-09-23 21:31:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:34,927 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-09-23 21:31:34,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-09-23 21:31:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 21:31:34,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:34,928 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:34,933 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:34,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:34,934 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-09-23 21:31:34,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:34,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:34,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:34,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-23 21:31:35,099 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:35,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:35,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:35,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:35,101 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-09-23 21:31:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:35,202 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-09-23 21:31:35,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:35,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-23 21:31:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:35,205 INFO L225 Difference]: With dead ends: 50 [2018-09-23 21:31:35,205 INFO L226 Difference]: Without dead ends: 29 [2018-09-23 21:31:35,206 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-09-23 21:31:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-23 21:31:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-23 21:31:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-23 21:31:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-09-23 21:31:35,214 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-09-23 21:31:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:35,214 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-09-23 21:31:35,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-09-23 21:31:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 21:31:35,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:35,216 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:35,216 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:35,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-09-23 21:31:35,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:35,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:35,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-23 21:31:35,305 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:35,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:35,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:35,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:35,307 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-09-23 21:31:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:35,485 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-09-23 21:31:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:35,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-23 21:31:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:35,488 INFO L225 Difference]: With dead ends: 74 [2018-09-23 21:31:35,488 INFO L226 Difference]: Without dead ends: 48 [2018-09-23 21:31:35,492 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-09-23 21:31:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-23 21:31:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-09-23 21:31:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-23 21:31:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-09-23 21:31:35,514 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-09-23 21:31:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:35,514 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-09-23 21:31:35,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-09-23 21:31:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-23 21:31:35,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:35,519 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:35,519 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:35,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-09-23 21:31:35,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:35,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:35,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:35,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-23 21:31:35,694 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:35,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:35,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:35,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:35,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:35,696 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-09-23 21:31:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:35,868 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-09-23 21:31:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:35,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-23 21:31:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:35,870 INFO L225 Difference]: With dead ends: 92 [2018-09-23 21:31:35,871 INFO L226 Difference]: Without dead ends: 51 [2018-09-23 21:31:35,871 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-09-23 21:31:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-23 21:31:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-23 21:31:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-23 21:31:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-09-23 21:31:35,882 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-09-23 21:31:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:35,882 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-09-23 21:31:35,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-09-23 21:31:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-23 21:31:35,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:35,884 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:35,884 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:35,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:35,885 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-09-23 21:31:35,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:35,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:35,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:35,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-23 21:31:35,994 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:35,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:35,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:35,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:35,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:35,996 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-09-23 21:31:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:36,071 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-09-23 21:31:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:36,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-23 21:31:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:36,075 INFO L225 Difference]: With dead ends: 71 [2018-09-23 21:31:36,075 INFO L226 Difference]: Without dead ends: 69 [2018-09-23 21:31:36,075 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-09-23 21:31:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-23 21:31:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-09-23 21:31:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-23 21:31:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-09-23 21:31:36,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-09-23 21:31:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:36,088 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-09-23 21:31:36,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-09-23 21:31:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-23 21:31:36,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:36,090 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:36,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:36,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-09-23 21:31:36,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:36,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-23 21:31:36,204 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:36,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:36,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:36,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:36,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:36,205 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-09-23 21:31:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:36,413 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-09-23 21:31:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:36,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-23 21:31:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:36,418 INFO L225 Difference]: With dead ends: 161 [2018-09-23 21:31:36,418 INFO L226 Difference]: Without dead ends: 100 [2018-09-23 21:31:36,419 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-09-23 21:31:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-23 21:31:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-23 21:31:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-23 21:31:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-09-23 21:31:36,434 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-09-23 21:31:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:36,435 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-09-23 21:31:36,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-09-23 21:31:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-23 21:31:36,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:36,438 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:36,438 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:36,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-09-23 21:31:36,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:36,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-23 21:31:36,523 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:36,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:36,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:36,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:36,525 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-09-23 21:31:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:36,702 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-09-23 21:31:36,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:36,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-09-23 21:31:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:36,704 INFO L225 Difference]: With dead ends: 205 [2018-09-23 21:31:36,705 INFO L226 Difference]: Without dead ends: 108 [2018-09-23 21:31:36,706 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-09-23 21:31:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-23 21:31:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-23 21:31:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-23 21:31:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-09-23 21:31:36,722 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-09-23 21:31:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:36,722 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-09-23 21:31:36,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-09-23 21:31:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-23 21:31:36,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:36,724 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:36,725 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:36,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-09-23 21:31:36,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:36,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-09-23 21:31:36,810 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:36,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:36,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:36,811 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-09-23 21:31:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:36,930 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-09-23 21:31:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:36,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-23 21:31:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:36,932 INFO L225 Difference]: With dead ends: 240 [2018-09-23 21:31:36,933 INFO L226 Difference]: Without dead ends: 135 [2018-09-23 21:31:36,934 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-09-23 21:31:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-23 21:31:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-23 21:31:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-23 21:31:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-09-23 21:31:36,953 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-09-23 21:31:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:36,954 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-09-23 21:31:36,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-09-23 21:31:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-23 21:31:36,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:36,956 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:36,956 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:36,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-09-23 21:31:36,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-09-23 21:31:37,025 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:37,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:37,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:37,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:37,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:37,026 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-09-23 21:31:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:37,462 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-09-23 21:31:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:37,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-09-23 21:31:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:37,465 INFO L225 Difference]: With dead ends: 297 [2018-09-23 21:31:37,465 INFO L226 Difference]: Without dead ends: 165 [2018-09-23 21:31:37,466 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-09-23 21:31:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-23 21:31:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-23 21:31:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-23 21:31:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-09-23 21:31:37,518 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-09-23 21:31:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:37,519 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-09-23 21:31:37,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-09-23 21:31:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-23 21:31:37,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:37,526 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:37,527 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:37,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:37,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-09-23 21:31:37,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:37,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:37,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:37,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-09-23 21:31:37,661 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:37,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:37,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:37,662 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-09-23 21:31:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:37,868 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-09-23 21:31:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:37,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-09-23 21:31:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:37,871 INFO L225 Difference]: With dead ends: 360 [2018-09-23 21:31:37,871 INFO L226 Difference]: Without dead ends: 198 [2018-09-23 21:31:37,872 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-09-23 21:31:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-23 21:31:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-09-23 21:31:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-23 21:31:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-09-23 21:31:37,892 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-09-23 21:31:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:37,893 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-09-23 21:31:37,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-09-23 21:31:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-23 21:31:37,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:37,895 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:37,895 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:37,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-09-23 21:31:37,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:37,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:37,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-23 21:31:38,010 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:31:38,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:31:38,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:31:38,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:31:38,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:31:38,012 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-09-23 21:31:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:38,339 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-09-23 21:31:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:31:38,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-09-23 21:31:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:38,343 INFO L225 Difference]: With dead ends: 429 [2018-09-23 21:31:38,343 INFO L226 Difference]: Without dead ends: 234 [2018-09-23 21:31:38,344 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-09-23 21:31:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-23 21:31:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-09-23 21:31:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-23 21:31:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-09-23 21:31:38,361 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-09-23 21:31:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:38,361 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-09-23 21:31:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:31:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-09-23 21:31:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-23 21:31:38,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:31:38,363 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:31:38,364 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:31:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:31:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-09-23 21:31:38,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:31:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:31:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:38,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:31:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-23 21:31:38,565 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:31:38,565 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 -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-09-23 21:31:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:31:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:31:38,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:31:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-23 21:31:38,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:31:38,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-23 21:31:38,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:31:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:31:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:31:38,778 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 4 states. [2018-09-23 21:31:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:31:39,385 INFO L93 Difference]: Finished difference Result 530 states and 632 transitions. [2018-09-23 21:31:39,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:31:39,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-09-23 21:31:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:31:39,387 INFO L225 Difference]: With dead ends: 530 [2018-09-23 21:31:39,387 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 21:31:39,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:31:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 21:31:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 21:31:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 21:31:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 21:31:39,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-09-23 21:31:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:31:39,390 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 21:31:39,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:31:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 21:31:39,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 21:31:39,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 21:31:40,148 WARN L178 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-09-23 21:31:40,384 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-09-23 21:31:40,625 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-09-23 21:31:40,973 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-09-23 21:31:41,162 INFO L422 ceAbstractionStarter]: At program point L440(lines 440 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,162 INFO L422 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,162 INFO L422 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,163 INFO L422 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4) (= ULTIMATE.start_ssl3_connect_~s__state~3 4432)) [2018-09-23 21:31:41,163 INFO L422 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,163 INFO L422 ceAbstractionStarter]: At program point L296(lines 296 307) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-09-23 21:31:41,163 INFO L422 ceAbstractionStarter]: At program point L420(lines 420 437) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,163 INFO L422 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,164 INFO L422 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,164 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 464) no Hoare annotation was computed. [2018-09-23 21:31:41,164 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-09-23 21:31:41,164 INFO L422 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,164 INFO L422 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,164 INFO L422 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,165 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-09-23 21:31:41,165 INFO L422 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-09-23 21:31:41,165 INFO L422 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,165 INFO L422 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-23 21:31:41,165 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 400) no Hoare annotation was computed. [2018-09-23 21:31:41,165 INFO L422 ceAbstractionStarter]: At program point L311(lines 306 330) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-09-23 21:31:41,181 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:31:41 BoogieIcfgContainer [2018-09-23 21:31:41,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:31:41,182 INFO L168 Benchmark]: Toolchain (without parser) took 8070.13 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 27.8 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -28.5 MB). Peak memory consumption was 490.2 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:41,184 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-09-23 21:31:41,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.03 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-09-23 21:31:41,185 INFO L168 Benchmark]: Boogie Preprocessor took 48.60 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-09-23 21:31:41,185 INFO L168 Benchmark]: RCFGBuilder took 651.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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-09-23 21:31:41,186 INFO L168 Benchmark]: TraceAbstraction took 7307.86 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 27.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -60.2 MB). Peak memory consumption was 458.5 MB. Max. memory is 7.1 GB. [2018-09-23 21:31:41,192 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.20 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. * Boogie Procedure Inliner took 56.03 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. * Boogie Preprocessor took 48.60 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. * RCFGBuilder took 651.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 7307.86 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 27.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -60.2 MB). Peak memory consumption was 458.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: 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: 239]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4432 - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 66 SDslu, 111 SDs, 0 SdLazy, 384 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=12, 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 314 NumberOfFragments, 335 HoareAnnotationTreeSize, 16 FomulaSimplifications, 3068 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 71345 SizeOfPredicates, 2 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2279/2289 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_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-31-41-223.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-31-41-223.csv Received shutdown request...