./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2373f3a3f8dbd9f18e573cbc80f9fee8c78900dc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:57:03,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:57:03,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:57:03,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:57:03,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:57:03,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:57:03,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:57:03,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:57:03,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:57:03,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:57:03,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:57:03,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:57:03,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:57:03,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:57:03,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:57:03,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:57:03,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:57:03,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:57:03,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:57:03,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:57:03,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:57:03,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:57:03,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:57:03,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:57:03,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:57:03,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:57:03,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:57:03,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:57:03,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:57:03,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:57:03,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:57:03,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:57:03,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:57:03,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:57:03,194 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:57:03,195 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:57:03,195 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:57:03,210 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:57:03,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:57:03,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:57:03,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:57:03,211 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:57:03,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:57:03,212 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:57:03,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:57:03,213 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:57:03,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:57:03,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:57:03,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:57:03,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:57:03,213 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:57:03,214 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:57:03,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:57:03,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:57:03,215 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:57:03,215 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:57:03,215 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:57:03,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:03,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:57:03,216 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:57:03,216 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:57:03,216 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:57:03,216 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:57:03,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:57:03,218 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2373f3a3f8dbd9f18e573cbc80f9fee8c78900dc [2019-01-14 14:57:03,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:57:03,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:57:03,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:57:03,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:57:03,278 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:57:03,279 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_false-unreach-call_true-termination.cil.c [2019-01-14 14:57:03,341 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51edb662/6b58b1500abd47f699c938774aac9281/FLAG30c503b3e [2019-01-14 14:57:03,775 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:57:03,777 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_false-unreach-call_true-termination.cil.c [2019-01-14 14:57:03,793 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51edb662/6b58b1500abd47f699c938774aac9281/FLAG30c503b3e [2019-01-14 14:57:04,106 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51edb662/6b58b1500abd47f699c938774aac9281 [2019-01-14 14:57:04,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:57:04,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:57:04,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:04,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:57:04,118 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:57:04,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2cb0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04, skipping insertion in model container [2019-01-14 14:57:04,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:57:04,197 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:57:04,499 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:04,504 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:57:04,573 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:04,591 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:57:04,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04 WrapperNode [2019-01-14 14:57:04,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:04,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:04,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:57:04,593 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:57:04,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:04,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:57:04,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:57:04,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:57:04,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... [2019-01-14 14:57:04,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:57:04,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:57:04,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:57:04,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:57:04,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:04,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:57:04,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:57:04,970 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:57:06,134 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 14:57:06,134 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 14:57:06,136 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:57:06,136 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:57:06,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:06 BoogieIcfgContainer [2019-01-14 14:57:06,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:57:06,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:57:06,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:57:06,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:57:06,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:57:04" (1/3) ... [2019-01-14 14:57:06,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114831fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:06, skipping insertion in model container [2019-01-14 14:57:06,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:04" (2/3) ... [2019-01-14 14:57:06,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114831fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:06, skipping insertion in model container [2019-01-14 14:57:06,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:06" (3/3) ... [2019-01-14 14:57:06,145 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_false-unreach-call_true-termination.cil.c [2019-01-14 14:57:06,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:57:06,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:57:06,180 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:57:06,212 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:57:06,213 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:57:06,213 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:57:06,214 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:57:06,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:57:06,214 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:57:06,214 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:57:06,214 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:57:06,214 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:57:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-01-14 14:57:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:57:06,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:06,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:06,253 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:06,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-01-14 14:57:06,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:06,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:06,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:06,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:06,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:06,506 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-01-14 14:57:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:06,841 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-01-14 14:57:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:06,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:57:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:06,856 INFO L225 Difference]: With dead ends: 251 [2019-01-14 14:57:06,857 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 14:57:06,861 INFO L631 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 [2019-01-14 14:57:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 14:57:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 14:57:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 14:57:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-01-14 14:57:06,904 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-01-14 14:57:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:06,904 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-01-14 14:57:06,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-01-14 14:57:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 14:57:06,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:06,907 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:06,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:06,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:06,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-01-14 14:57:06,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:06,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:06,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:06,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:06,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:07,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:07,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:07,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:07,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:07,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:07,013 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-01-14 14:57:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:07,305 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-01-14 14:57:07,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:07,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-14 14:57:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:07,308 INFO L225 Difference]: With dead ends: 237 [2019-01-14 14:57:07,308 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 14:57:07,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 14:57:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-01-14 14:57:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 14:57:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-01-14 14:57:07,323 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-01-14 14:57:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:07,323 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-01-14 14:57:07,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-01-14 14:57:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 14:57:07,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:07,326 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:07,326 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-01-14 14:57:07,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:07,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 14:57:07,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:07,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:07,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:07,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:07,544 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-01-14 14:57:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:07,892 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-01-14 14:57:07,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:07,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-14 14:57:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:07,895 INFO L225 Difference]: With dead ends: 271 [2019-01-14 14:57:07,896 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 14:57:07,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 14:57:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-01-14 14:57:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 14:57:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-01-14 14:57:07,908 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-01-14 14:57:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:07,909 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-01-14 14:57:07,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-01-14 14:57:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:57:07,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:07,912 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:07,912 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-01-14 14:57:07,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:07,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:07,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 14:57:08,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:08,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:08,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:08,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:08,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,050 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-01-14 14:57:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:08,366 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-01-14 14:57:08,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:08,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:57:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:08,370 INFO L225 Difference]: With dead ends: 334 [2019-01-14 14:57:08,370 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 14:57:08,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 14:57:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-01-14 14:57:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-14 14:57:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-01-14 14:57:08,390 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-01-14 14:57:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:08,391 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-01-14 14:57:08,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-01-14 14:57:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:57:08,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:08,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:08,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:08,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-01-14 14:57:08,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:08,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:08,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 14:57:08,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:08,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:08,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:08,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,529 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-01-14 14:57:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:08,830 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-01-14 14:57:08,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:08,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:57:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:08,834 INFO L225 Difference]: With dead ends: 389 [2019-01-14 14:57:08,834 INFO L226 Difference]: Without dead ends: 211 [2019-01-14 14:57:08,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-14 14:57:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-01-14 14:57:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-14 14:57:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-01-14 14:57:08,847 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-01-14 14:57:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:08,848 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-01-14 14:57:08,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-01-14 14:57:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:57:08,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:08,851 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:08,852 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-01-14 14:57:08,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:08,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:08,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-14 14:57:08,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:08,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:08,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:08,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:08,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,949 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-01-14 14:57:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:09,146 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-01-14 14:57:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:09,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:57:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:09,148 INFO L225 Difference]: With dead ends: 427 [2019-01-14 14:57:09,149 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 14:57:09,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 14:57:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-14 14:57:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-14 14:57:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-01-14 14:57:09,159 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-01-14 14:57:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:09,160 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-01-14 14:57:09,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-01-14 14:57:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 14:57:09,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:09,163 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:09,163 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:09,163 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-01-14 14:57:09,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:09,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 14:57:09,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:09,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:09,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:09,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:09,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:09,305 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-01-14 14:57:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:09,372 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-01-14 14:57:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:09,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 14:57:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:09,383 INFO L225 Difference]: With dead ends: 661 [2019-01-14 14:57:09,386 INFO L226 Difference]: Without dead ends: 443 [2019-01-14 14:57:09,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-01-14 14:57:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-01-14 14:57:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-14 14:57:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-01-14 14:57:09,425 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-01-14 14:57:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:09,425 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-01-14 14:57:09,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-01-14 14:57:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 14:57:09,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:09,434 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:09,434 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-01-14 14:57:09,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:09,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:09,655 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 14:57:09,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:57:09 BoogieIcfgContainer [2019-01-14 14:57:09,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:57:09,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:57:09,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:57:09,734 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:57:09,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:06" (3/4) ... [2019-01-14 14:57:09,737 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 14:57:09,881 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:57:09,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:57:09,885 INFO L168 Benchmark]: Toolchain (without parser) took 5774.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.7 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -202.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:09,887 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:09,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:09,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:09,888 INFO L168 Benchmark]: Boogie Preprocessor took 44.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:09,889 INFO L168 Benchmark]: RCFGBuilder took 1364.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:09,889 INFO L168 Benchmark]: TraceAbstraction took 3594.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -133.0 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:09,890 INFO L168 Benchmark]: Witness Printer took 151.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:09,894 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1364.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.2 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3594.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -133.0 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. * Witness Printer took 151.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 574]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L579] int s ; [L583] s = 12292 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__bbio = __VERIFIER_nondet_int() ; [L22] int s__wbio = __VERIFIER_nondet_int() ; [L23] int s__hit = __VERIFIER_nondet_int() ; [L24] int s__rwstate ; [L25] int s__init_buf___0 = __VERIFIER_nondet_int() ; [L26] int s__debug = __VERIFIER_nondet_int() ; [L27] int s__shutdown ; [L28] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L29] int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_connect = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int() ; [L33] int s__s3__change_cipher_spec ; [L34] int s__s3__flags = __VERIFIER_nondet_int() ; [L35] int s__s3__delay_buf_pop_ret ; [L36] int s__s3__tmp__cert_req = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_compression = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int() ; [L43] int s__session__cipher ; [L44] int s__session__compress_meth ; [L45] int buf ; [L46] unsigned long tmp ; [L47] unsigned long l ; [L48] int num1 = __VERIFIER_nondet_int() ; [L49] int cb ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int tmp___0 ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 = __VERIFIER_nondet_int() ; [L62] int tmp___8 = __VERIFIER_nondet_int() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] void *__cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L69] void *__cil_tmp59 ; [L70] unsigned long __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L72] unsigned long __cil_tmp62 ; [L73] unsigned long __cil_tmp63 ; [L74] unsigned long __cil_tmp64 ; [L75] long __cil_tmp65 = __VERIFIER_nondet_long() ; [L76] long __cil_tmp66 ; [L77] long __cil_tmp67 ; [L78] long __cil_tmp68 ; [L79] long __cil_tmp69 ; [L80] long __cil_tmp70 = __VERIFIER_nondet_long() ; [L81] long __cil_tmp71 ; [L82] long __cil_tmp72 ; [L83] long __cil_tmp73 ; [L84] long __cil_tmp74 ; [L88] s__state = initial_state [L89] blastFlag = 0 [L90] tmp = __VERIFIER_nondet_int() [L91] cb = 0 [L92] ret = -1 [L93] skip = 0 [L94] tmp___0 = 0 [L95] COND TRUE s__info_callback != 0 [L96] cb = s__info_callback [L102] s__in_handshake ++ [L103] COND FALSE !(tmp___1 + 12288) [L109] COND TRUE 1 [L111] state = s__state [L112] COND TRUE s__state == 12292 [L214] s__new_session = 1 [L215] s__state = 4096 [L216] s__ctx__stats__sess_connect_renegotiate ++ [L221] s__server = 0 [L222] COND TRUE cb != 0 [L226] __cil_tmp55 = s__version + 65280 [L227] COND FALSE !(__cil_tmp55 != 768) [L232] s__type = 4096 [L234] __cil_tmp56 = (void *)0 [L235] __cil_tmp57 = (unsigned long )__cil_tmp56 [L236] __cil_tmp58 = (unsigned long )s__init_buf___0 [L237] COND FALSE !(__cil_tmp58 == __cil_tmp57) [L255] COND FALSE !(! tmp___4) [L259] COND FALSE !(! tmp___5) [L263] s__state = 4368 [L264] s__ctx__stats__sess_connect ++ [L265] s__init_num = 0 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND TRUE s__state == 4368 [L269] s__shutdown = 0 [L270] ret = __VERIFIER_nondet_int() [L271] COND TRUE blastFlag == 0 [L272] blastFlag = 1 [L274] COND FALSE !(ret <= 0) [L277] s__state = 4384 [L278] s__init_num = 0 [L280] __cil_tmp62 = (unsigned long )s__wbio [L281] __cil_tmp63 = (unsigned long )s__bbio [L282] COND TRUE __cil_tmp63 != __cil_tmp62 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND TRUE s__state == 4384 [L289] ret = __VERIFIER_nondet_int() [L290] COND TRUE blastFlag == 1 [L291] blastFlag = 2 [L297] COND FALSE !(ret <= 0) [L300] COND FALSE !(\read(s__hit)) [L303] s__state = 4400 [L305] s__init_num = 0 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND FALSE !(s__state == 4384) [L136] COND FALSE !(s__state == 4385) [L139] COND TRUE s__state == 4400 [L310] __cil_tmp64 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L311] COND FALSE !(__cil_tmp64 + 256UL) [L314] ret = __VERIFIER_nondet_int() [L315] COND TRUE blastFlag == 2 [L316] blastFlag = 3 [L318] COND FALSE !(ret <= 0) [L323] s__state = 4416 [L324] s__init_num = 0 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND FALSE !(s__state == 4384) [L136] COND FALSE !(s__state == 4385) [L139] COND FALSE !(s__state == 4400) [L142] COND FALSE !(s__state == 4401) [L145] COND TRUE s__state == 4416 [L328] ret = __VERIFIER_nondet_int() [L329] COND TRUE blastFlag == 3 [L330] blastFlag = 4 [L332] COND FALSE !(ret <= 0) [L335] s__state = 4432 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND FALSE !(s__state == 4384) [L136] COND FALSE !(s__state == 4385) [L139] COND FALSE !(s__state == 4400) [L142] COND FALSE !(s__state == 4401) [L145] COND FALSE !(s__state == 4416) [L148] COND FALSE !(s__state == 4417) [L151] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 4 [L574] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. UNSAFE Result, 3.5s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1223 SDtfs, 255 SDslu, 651 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred 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, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 47530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 316/316 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...