./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-2.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 3bba758cc64c45156c09d7dbdd14abb9dadc75f2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-27 22:35:32,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:32,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:32,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:32,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:32,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:32,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:32,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:32,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:32,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:32,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:32,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:32,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:32,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:32,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:32,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:32,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:32,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:32,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:32,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:32,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:32,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:32,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:32,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:32,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:32,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:32,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:32,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:32,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:32,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:32,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:32,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:32,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:32,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:32,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:32,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:32,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:32,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:32,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:32,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:32,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:32,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:32,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:32,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:32,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:32,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:32,179 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:32,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:32,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:32,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:32,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:32,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:32,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:32,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:32,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:32,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:32,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:32,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:32,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:32,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:32,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:32,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:32,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:32,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:32,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:32,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:32,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:32,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:32,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:32,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:32,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 3bba758cc64c45156c09d7dbdd14abb9dadc75f2 [2019-11-27 22:35:32,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:32,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:32,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:32,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:32,541 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:32,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-2.c [2019-11-27 22:35:32,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/648858cbb/f264664366b74e6eb708b4718921a67b/FLAGcc4a0d38d [2019-11-27 22:35:33,114 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:33,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-2.c [2019-11-27 22:35:33,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/648858cbb/f264664366b74e6eb708b4718921a67b/FLAGcc4a0d38d [2019-11-27 22:35:33,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/648858cbb/f264664366b74e6eb708b4718921a67b [2019-11-27 22:35:33,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:33,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:33,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:33,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:33,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:33,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:33,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42597099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33, skipping insertion in model container [2019-11-27 22:35:33,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:33,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:33,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:33,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:33,876 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:33,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:33,956 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:33,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33 WrapperNode [2019-11-27 22:35:33,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:33,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:33,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:33,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:33,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:33,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:34,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:34,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:34,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:34,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (1/1) ... [2019-11-27 22:35:34,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:34,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:34,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:34,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:34,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35: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 [2019-11-27 22:35:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:34,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:34,297 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:34,925 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-27 22:35:34,926 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-27 22:35:34,930 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:34,930 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:34,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:34 BoogieIcfgContainer [2019-11-27 22:35:34,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:34,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:34,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:34,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:34,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:33" (1/3) ... [2019-11-27 22:35:34,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105ab0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:34, skipping insertion in model container [2019-11-27 22:35:34,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:33" (2/3) ... [2019-11-27 22:35:34,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105ab0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:34, skipping insertion in model container [2019-11-27 22:35:34,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:34" (3/3) ... [2019-11-27 22:35:34,940 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-2.c [2019-11-27 22:35:34,950 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:34,957 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:34,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:34,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:34,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:34,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:34,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:34,996 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:34,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:34,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:34,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-27 22:35:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:35,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,027 INFO L410 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-11-27 22:35:35,028 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-27 22:35:35,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361400349] [2019-11-27 22:35:35,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:35,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361400349] [2019-11-27 22:35:35,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:35,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296692620] [2019-11-27 22:35:35,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,250 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-27 22:35:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,463 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-27 22:35:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,477 INFO L225 Difference]: With dead ends: 251 [2019-11-27 22:35:35,478 INFO L226 Difference]: Without dead ends: 114 [2019-11-27 22:35:35,481 INFO L630 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-11-27 22:35:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-27 22:35:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-27 22:35:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-27 22:35:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-27 22:35:35,527 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-27 22:35:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,527 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-27 22:35:35,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-27 22:35:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:35:35,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,530 INFO L410 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-11-27 22:35:35,530 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-27 22:35:35,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19290538] [2019-11-27 22:35:35,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:35,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19290538] [2019-11-27 22:35:35,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551372125] [2019-11-27 22:35:35,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,615 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-27 22:35:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,799 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-27 22:35:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:35:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,801 INFO L225 Difference]: With dead ends: 237 [2019-11-27 22:35:35,803 INFO L226 Difference]: Without dead ends: 132 [2019-11-27 22:35:35,805 INFO L630 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-11-27 22:35:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-27 22:35:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-27 22:35:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 22:35:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-27 22:35:35,832 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-27 22:35:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,833 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-27 22:35:35,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-27 22:35:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:35:35,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,836 INFO L410 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-11-27 22:35:35,836 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,837 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-27 22:35:35,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564702392] [2019-11-27 22:35:35,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:35:35,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564702392] [2019-11-27 22:35:35,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726051300] [2019-11-27 22:35:35,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,973 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-27 22:35:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,114 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-11-27 22:35:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:35:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,117 INFO L225 Difference]: With dead ends: 271 [2019-11-27 22:35:36,117 INFO L226 Difference]: Without dead ends: 151 [2019-11-27 22:35:36,118 INFO L630 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-11-27 22:35:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-27 22:35:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-11-27 22:35:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 22:35:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-27 22:35:36,139 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-27 22:35:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,140 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-27 22:35:36,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-27 22:35:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:36,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,148 INFO L410 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-11-27 22:35:36,149 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-11-27 22:35:36,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123299120] [2019-11-27 22:35:36,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:36,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123299120] [2019-11-27 22:35:36,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:36,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255820542] [2019-11-27 22:35:36,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,303 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-27 22:35:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,487 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-27 22:35:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,491 INFO L225 Difference]: With dead ends: 334 [2019-11-27 22:35:36,491 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 22:35:36,492 INFO L630 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-11-27 22:35:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 22:35:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-27 22:35:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-27 22:35:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-27 22:35:36,510 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-27 22:35:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,510 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-27 22:35:36,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-27 22:35:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:36,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,516 INFO L410 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-11-27 22:35:36,516 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-11-27 22:35:36,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951002293] [2019-11-27 22:35:36,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:36,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951002293] [2019-11-27 22:35:36,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:36,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700116169] [2019-11-27 22:35:36,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,597 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-27 22:35:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,733 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-27 22:35:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,736 INFO L225 Difference]: With dead ends: 389 [2019-11-27 22:35:36,736 INFO L226 Difference]: Without dead ends: 211 [2019-11-27 22:35:36,738 INFO L630 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-11-27 22:35:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-27 22:35:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-27 22:35:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-27 22:35:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-27 22:35:36,748 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-27 22:35:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,748 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-27 22:35:36,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-27 22:35:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:36,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,751 INFO L410 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-11-27 22:35:36,751 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-11-27 22:35:36,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439784831] [2019-11-27 22:35:36,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:35:36,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439784831] [2019-11-27 22:35:36,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:36,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671126009] [2019-11-27 22:35:36,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,835 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-27 22:35:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,998 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-27 22:35:36,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,001 INFO L225 Difference]: With dead ends: 427 [2019-11-27 22:35:37,001 INFO L226 Difference]: Without dead ends: 230 [2019-11-27 22:35:37,002 INFO L630 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-11-27 22:35:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-27 22:35:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-27 22:35:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-27 22:35:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-27 22:35:37,010 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-27 22:35:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,011 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-27 22:35:37,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-27 22:35:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:35:37,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,013 INFO L410 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-11-27 22:35:37,013 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-11-27 22:35:37,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245479057] [2019-11-27 22:35:37,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:35:37,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245479057] [2019-11-27 22:35:37,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997220426] [2019-11-27 22:35:37,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,097 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-27 22:35:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,156 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-27 22:35:37,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:35:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,160 INFO L225 Difference]: With dead ends: 661 [2019-11-27 22:35:37,160 INFO L226 Difference]: Without dead ends: 443 [2019-11-27 22:35:37,161 INFO L630 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-11-27 22:35:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-27 22:35:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-27 22:35:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-27 22:35:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-27 22:35:37,177 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-27 22:35:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,177 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-27 22:35:37,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-27 22:35:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-27 22:35:37,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,180 INFO L410 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-11-27 22:35:37,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-11-27 22:35:37,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081742365] [2019-11-27 22:35:37,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:37,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:35:37,397 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:35:37,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:37 BoogieIcfgContainer [2019-11-27 22:35:37,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:37,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:37,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:37,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:37,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:34" (3/4) ... [2019-11-27 22:35:37,515 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:35:37,672 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:37,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:37,675 INFO L168 Benchmark]: Toolchain (without parser) took 4194.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -197.2 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:37,676 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:37,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:37,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:37,677 INFO L168 Benchmark]: Boogie Preprocessor took 54.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:37,677 INFO L168 Benchmark]: RCFGBuilder took 851.61 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:37,678 INFO L168 Benchmark]: TraceAbstraction took 2578.79 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -126.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:37,678 INFO L168 Benchmark]: Witness Printer took 160.85 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:37,681 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 851.61 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2578.79 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -126.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 160.85 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 573]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L578] int s ; [L582] s = 12292 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__bbio = __VERIFIER_nondet_int() ; [L21] int s__wbio = __VERIFIER_nondet_int() ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = __VERIFIER_nondet_int() ; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L28] int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_int() ; [L29] int s__ctx__stats__sess_connect = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int() ; [L32] int s__s3__change_cipher_spec ; [L33] int s__s3__flags = __VERIFIER_nondet_int() ; [L34] int s__s3__delay_buf_pop_ret ; [L35] int s__s3__tmp__cert_req = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__new_compression = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int() ; [L42] int s__session__cipher ; [L43] int s__session__compress_meth ; [L44] int buf ; [L45] unsigned long tmp ; [L46] unsigned long l ; [L47] int num1 = __VERIFIER_nondet_int() ; [L48] int cb ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int tmp___0 ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 = __VERIFIER_nondet_int() ; [L61] int tmp___8 = __VERIFIER_nondet_int() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] void *__cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L68] void *__cil_tmp59 ; [L69] unsigned long __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L71] unsigned long __cil_tmp62 ; [L72] unsigned long __cil_tmp63 ; [L73] unsigned long __cil_tmp64 ; [L74] long __cil_tmp65 = __VERIFIER_nondet_long() ; [L75] long __cil_tmp66 ; [L76] long __cil_tmp67 ; [L77] long __cil_tmp68 ; [L78] long __cil_tmp69 ; [L79] long __cil_tmp70 = __VERIFIER_nondet_long() ; [L80] long __cil_tmp71 ; [L81] long __cil_tmp72 ; [L82] long __cil_tmp73 ; [L83] long __cil_tmp74 ; [L87] s__state = initial_state [L88] blastFlag = 0 [L89] tmp = __VERIFIER_nondet_int() [L90] cb = 0 [L91] ret = -1 [L92] skip = 0 [L93] tmp___0 = 0 [L94] COND TRUE s__info_callback != 0 [L95] cb = s__info_callback [L101] s__in_handshake ++ [L102] COND FALSE !(tmp___1 + 12288) [L108] COND TRUE 1 [L110] state = s__state [L111] COND TRUE s__state == 12292 [L213] s__new_session = 1 [L214] s__state = 4096 [L215] s__ctx__stats__sess_connect_renegotiate ++ [L220] s__server = 0 [L221] COND TRUE cb != 0 [L225] __cil_tmp55 = s__version + 65280 [L226] COND FALSE !(__cil_tmp55 != 768) [L231] s__type = 4096 [L233] __cil_tmp56 = (void *)0 [L234] __cil_tmp57 = (unsigned long )__cil_tmp56 [L235] __cil_tmp58 = (unsigned long )s__init_buf___0 [L236] COND FALSE !(__cil_tmp58 == __cil_tmp57) [L254] COND FALSE !(! tmp___4) [L258] COND FALSE !(! tmp___5) [L262] s__state = 4368 [L263] s__ctx__stats__sess_connect ++ [L264] s__init_num = 0 [L545] COND FALSE !(! s__s3__tmp__reuse_message) [L562] skip = 0 [L108] COND TRUE 1 [L110] state = s__state [L111] COND FALSE !(s__state == 12292) [L114] COND FALSE !(s__state == 16384) [L117] COND FALSE !(s__state == 4096) [L120] COND FALSE !(s__state == 20480) [L123] COND FALSE !(s__state == 4099) [L126] COND TRUE s__state == 4368 [L268] s__shutdown = 0 [L269] ret = __VERIFIER_nondet_int() [L270] COND TRUE blastFlag == 0 [L271] blastFlag = 1 [L273] COND FALSE !(ret <= 0) [L276] s__state = 4384 [L277] s__init_num = 0 [L279] __cil_tmp62 = (unsigned long )s__wbio [L280] __cil_tmp63 = (unsigned long )s__bbio [L281] COND TRUE __cil_tmp63 != __cil_tmp62 [L545] COND FALSE !(! s__s3__tmp__reuse_message) [L562] skip = 0 [L108] COND TRUE 1 [L110] state = s__state [L111] COND FALSE !(s__state == 12292) [L114] COND FALSE !(s__state == 16384) [L117] COND FALSE !(s__state == 4096) [L120] COND FALSE !(s__state == 20480) [L123] COND FALSE !(s__state == 4099) [L126] COND FALSE !(s__state == 4368) [L129] COND FALSE !(s__state == 4369) [L132] COND TRUE s__state == 4384 [L288] ret = __VERIFIER_nondet_int() [L289] COND TRUE blastFlag == 1 [L290] blastFlag = 2 [L296] COND FALSE !(ret <= 0) [L299] COND FALSE !(\read(s__hit)) [L302] s__state = 4400 [L304] s__init_num = 0 [L545] COND FALSE !(! s__s3__tmp__reuse_message) [L562] skip = 0 [L108] COND TRUE 1 [L110] state = s__state [L111] COND FALSE !(s__state == 12292) [L114] COND FALSE !(s__state == 16384) [L117] COND FALSE !(s__state == 4096) [L120] COND FALSE !(s__state == 20480) [L123] COND FALSE !(s__state == 4099) [L126] COND FALSE !(s__state == 4368) [L129] COND FALSE !(s__state == 4369) [L132] COND FALSE !(s__state == 4384) [L135] COND FALSE !(s__state == 4385) [L138] COND TRUE s__state == 4400 [L309] __cil_tmp64 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L310] COND FALSE !(__cil_tmp64 + 256UL) [L313] ret = __VERIFIER_nondet_int() [L314] COND TRUE blastFlag == 2 [L315] blastFlag = 3 [L317] COND FALSE !(ret <= 0) [L322] s__state = 4416 [L323] s__init_num = 0 [L545] COND FALSE !(! s__s3__tmp__reuse_message) [L562] skip = 0 [L108] COND TRUE 1 [L110] state = s__state [L111] COND FALSE !(s__state == 12292) [L114] COND FALSE !(s__state == 16384) [L117] COND FALSE !(s__state == 4096) [L120] COND FALSE !(s__state == 20480) [L123] COND FALSE !(s__state == 4099) [L126] COND FALSE !(s__state == 4368) [L129] COND FALSE !(s__state == 4369) [L132] COND FALSE !(s__state == 4384) [L135] COND FALSE !(s__state == 4385) [L138] COND FALSE !(s__state == 4400) [L141] COND FALSE !(s__state == 4401) [L144] COND TRUE s__state == 4416 [L327] ret = __VERIFIER_nondet_int() [L328] COND TRUE blastFlag == 3 [L329] blastFlag = 4 [L331] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L545] COND FALSE !(! s__s3__tmp__reuse_message) [L562] skip = 0 [L108] COND TRUE 1 [L110] state = s__state [L111] COND FALSE !(s__state == 12292) [L114] COND FALSE !(s__state == 16384) [L117] COND FALSE !(s__state == 4096) [L120] COND FALSE !(s__state == 20480) [L123] COND FALSE !(s__state == 4099) [L126] COND FALSE !(s__state == 4368) [L129] COND FALSE !(s__state == 4369) [L132] COND FALSE !(s__state == 4384) [L135] COND FALSE !(s__state == 4385) [L138] COND FALSE !(s__state == 4400) [L141] COND FALSE !(s__state == 4401) [L144] COND FALSE !(s__state == 4416) [L147] COND FALSE !(s__state == 4417) [L150] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND TRUE blastFlag == 4 [L573] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1223 SDtfs, 255 SDslu, 651 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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 DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s 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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...