./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_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_1_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 ff50a3e94c359682cac670534eb61004d817453f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:56:46,846 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:56:46,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:56:46,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:56:46,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:56:46,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:56:46,862 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:56:46,864 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:56:46,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:56:46,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:56:46,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:56:46,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:56:46,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:56:46,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:56:46,872 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:56:46,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:56:46,874 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:56:46,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:56:46,878 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:56:46,879 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:56:46,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:56:46,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:56:46,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:56:46,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:56:46,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:56:46,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:56:46,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:56:46,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:56:46,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:56:46,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:56:46,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:56:46,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:56:46,892 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:56:46,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:56:46,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:56:46,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:56:46,894 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:56:46,909 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:56:46,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:56:46,910 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:56:46,910 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:56:46,910 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:56:46,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:56:46,911 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:56:46,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:56:46,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:56:46,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:56:46,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:56:46,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:56:46,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:56:46,912 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:56:46,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:56:46,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:56:46,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:56:46,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:56:46,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:56:46,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:56:46,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:56:46,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:56:46,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:56:46,916 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:56:46,916 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:56:46,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:56:46,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:56:46,917 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 -> ff50a3e94c359682cac670534eb61004d817453f [2019-01-14 14:56:46,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:56:46,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:56:46,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:56:46,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:56:46,994 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:56:46,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_false-unreach-call_true-termination.cil.c [2019-01-14 14:56:47,055 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9d9e8de/8354e27da5bb4cb39d398de1e822954b/FLAG909cb1f9c [2019-01-14 14:56:47,530 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:56:47,531 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_1_false-unreach-call_true-termination.cil.c [2019-01-14 14:56:47,548 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9d9e8de/8354e27da5bb4cb39d398de1e822954b/FLAG909cb1f9c [2019-01-14 14:56:47,865 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9d9e8de/8354e27da5bb4cb39d398de1e822954b [2019-01-14 14:56:47,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:56:47,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:56:47,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:56:47,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:56:47,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:56:47,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:56:47" (1/1) ... [2019-01-14 14:56:47,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb4684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:47, skipping insertion in model container [2019-01-14 14:56:47,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:56:47" (1/1) ... [2019-01-14 14:56:47,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:56:47,945 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:56:48,317 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:56:48,324 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:56:48,377 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:56:48,392 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:56:48,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48 WrapperNode [2019-01-14 14:56:48,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:56:48,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:56:48,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:56:48,394 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:56:48,402 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:56:48" (1/1) ... [2019-01-14 14:56:48,410 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:56:48" (1/1) ... [2019-01-14 14:56:48,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:56:48,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:56:48,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:56:48,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:56:48,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (1/1) ... [2019-01-14 14:56:48,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (1/1) ... [2019-01-14 14:56:48,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (1/1) ... [2019-01-14 14:56:48,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (1/1) ... [2019-01-14 14:56:48,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (1/1) ... [2019-01-14 14:56:48,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (1/1) ... [2019-01-14 14:56:48,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (1/1) ... [2019-01-14 14:56:48,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:56:48,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:56:48,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:56:48,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:56:48,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (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:56:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:56:48,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:56:48,792 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:56:49,815 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 14:56:49,815 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 14:56:49,817 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:56:49,817 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:56:49,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:56:49 BoogieIcfgContainer [2019-01-14 14:56:49,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:56:49,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:56:49,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:56:49,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:56:49,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:56:47" (1/3) ... [2019-01-14 14:56:49,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cada08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:56:49, skipping insertion in model container [2019-01-14 14:56:49,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:56:48" (2/3) ... [2019-01-14 14:56:49,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cada08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:56:49, skipping insertion in model container [2019-01-14 14:56:49,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:56:49" (3/3) ... [2019-01-14 14:56:49,827 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_false-unreach-call_true-termination.cil.c [2019-01-14 14:56:49,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:56:49,845 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:56:49,860 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:56:49,892 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:56:49,893 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:56:49,893 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:56:49,894 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:56:49,894 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:56:49,894 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:56:49,894 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:56:49,894 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:56:49,894 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:56:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-01-14 14:56:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:56:49,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:49,920 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:56:49,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-01-14 14:56:49,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:49,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:49,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:56:50,153 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:56:50,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:56:50,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:56:50,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:56:50,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:56:50,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:56:50,179 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-01-14 14:56:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:56:50,551 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-01-14 14:56:50,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:56:50,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:56:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:56:50,577 INFO L225 Difference]: With dead ends: 249 [2019-01-14 14:56:50,578 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 14:56:50,582 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:56:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 14:56:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-14 14:56:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 14:56:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-01-14 14:56:50,626 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-01-14 14:56:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:56:50,626 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-01-14 14:56:50,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:56:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-01-14 14:56:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 14:56:50,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:50,629 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:56:50,629 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-01-14 14:56:50,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:50,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:56:50,736 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:56:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:56:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:56:50,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:56:50,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:56:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:56:50,739 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-01-14 14:56:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:56:51,295 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-01-14 14:56:51,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:56:51,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-14 14:56:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:56:51,298 INFO L225 Difference]: With dead ends: 235 [2019-01-14 14:56:51,298 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 14:56:51,299 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:56:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 14:56:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-01-14 14:56:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 14:56:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-01-14 14:56:51,312 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-01-14 14:56:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:56:51,313 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-01-14 14:56:51,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:56:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-01-14 14:56:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 14:56:51,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:51,315 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:56:51,315 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-01-14 14:56:51,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:51,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:56:51,394 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:56:51,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:56:51,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:56:51,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:56:51,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:56:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:56:51,396 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-01-14 14:56:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:56:51,626 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-01-14 14:56:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:56:51,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-14 14:56:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:56:51,629 INFO L225 Difference]: With dead ends: 268 [2019-01-14 14:56:51,630 INFO L226 Difference]: Without dead ends: 149 [2019-01-14 14:56:51,631 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:56:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-14 14:56:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-01-14 14:56:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-14 14:56:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-01-14 14:56:51,644 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-01-14 14:56:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:56:51,644 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-01-14 14:56:51,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:56:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-01-14 14:56:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:56:51,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:51,648 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:56:51,648 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-01-14 14:56:51,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:51,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:51,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:56:51,811 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:56:51,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:56:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:56:51,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:56:51,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:56:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:56:51,813 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-01-14 14:56:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:56:52,174 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-01-14 14:56:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:56:52,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:56:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:56:52,178 INFO L225 Difference]: With dead ends: 332 [2019-01-14 14:56:52,178 INFO L226 Difference]: Without dead ends: 195 [2019-01-14 14:56:52,179 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:56:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-14 14:56:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-01-14 14:56:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-14 14:56:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-01-14 14:56:52,191 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-01-14 14:56:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:56:52,192 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-01-14 14:56:52,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:56:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-01-14 14:56:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:56:52,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:52,195 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:56:52,195 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-01-14 14:56:52,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:52,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:52,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:56:52,281 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:56:52,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:56:52,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:56:52,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:56:52,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:56:52,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:56:52,282 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-01-14 14:56:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:56:52,517 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-01-14 14:56:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:56:52,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:56:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:56:52,520 INFO L225 Difference]: With dead ends: 386 [2019-01-14 14:56:52,521 INFO L226 Difference]: Without dead ends: 209 [2019-01-14 14:56:52,522 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:56:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-14 14:56:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-01-14 14:56:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-14 14:56:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-01-14 14:56:52,533 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-01-14 14:56:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:56:52,534 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-01-14 14:56:52,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:56:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-01-14 14:56:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:56:52,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:52,537 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] [2019-01-14 14:56:52,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-01-14 14:56:52,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:52,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:52,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:52,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:56:52,672 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:56:52,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:56:52,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:56:52,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:56:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:56:52,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:56:52,676 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-01-14 14:56:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:56:52,837 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-01-14 14:56:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:56:52,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:56:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:56:52,841 INFO L225 Difference]: With dead ends: 425 [2019-01-14 14:56:52,841 INFO L226 Difference]: Without dead ends: 229 [2019-01-14 14:56:52,842 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:56:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-14 14:56:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-14 14:56:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-14 14:56:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-01-14 14:56:52,852 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-01-14 14:56:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:56:52,853 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-01-14 14:56:52,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:56:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-01-14 14:56:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 14:56:52,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:52,857 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] [2019-01-14 14:56:52,857 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-01-14 14:56:52,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:52,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:52,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:56:52,951 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:56:52,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:56:52,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:56:52,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:56:52,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:56:52,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:56:52,953 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-01-14 14:56:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:56:53,034 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-01-14 14:56:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:56:53,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-14 14:56:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:56:53,043 INFO L225 Difference]: With dead ends: 658 [2019-01-14 14:56:53,048 INFO L226 Difference]: Without dead ends: 441 [2019-01-14 14:56:53,049 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:56:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-01-14 14:56:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-01-14 14:56:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-01-14 14:56:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-01-14 14:56:53,085 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-01-14 14:56:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:56:53,086 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-01-14 14:56:53,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:56:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-01-14 14:56:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 14:56:53,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:56:53,096 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] [2019-01-14 14:56:53,096 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:56:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:56:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-01-14 14:56:53,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:56:53,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:56:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:56:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:56:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:56:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:56:53,238 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 14:56:53,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:56:53 BoogieIcfgContainer [2019-01-14 14:56:53,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:56:53,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:56:53,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:56:53,324 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:56:53,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:56:49" (3/4) ... [2019-01-14 14:56:53,327 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 14:56:53,455 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:56:53,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:56:53,456 INFO L168 Benchmark]: Toolchain (without parser) took 5586.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -223.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:56:53,458 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:56:53,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.36 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.5 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-01-14 14:56:53,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:56:53,459 INFO L168 Benchmark]: Boogie Preprocessor took 64.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:56:53,459 INFO L168 Benchmark]: RCFGBuilder took 1224.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:56:53,460 INFO L168 Benchmark]: TraceAbstraction took 3504.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.1 MB). Peak memory consumption was 259.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:56:53,460 INFO L168 Benchmark]: Witness Printer took 131.70 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: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-01-14 14:56:53,462 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 522.36 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.5 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1224.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3504.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.1 MB). Peak memory consumption was 259.6 MB. Max. memory is 11.5 GB. * Witness Printer took 131.70 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: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 544]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L549] int s ; [L553] 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 ; [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 ; [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 ; [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] long __cil_tmp56 ; [L66] long __cil_tmp57 ; [L67] long __cil_tmp58 ; [L68] long __cil_tmp59 ; [L69] long __cil_tmp60 ; [L70] long __cil_tmp61 ; [L71] long __cil_tmp62 ; [L72] long __cil_tmp63 ; [L73] long __cil_tmp64 ; [L77] s__state = initial_state [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND FALSE !(tmp___1 - 12288) [L98] COND TRUE 1 [L100] state = s__state [L101] COND TRUE s__state == 12292 [L203] s__new_session = 1 [L204] s__state = 4096 [L205] s__ctx__stats__sess_connect_renegotiate ++ [L210] s__server = 0 [L211] COND TRUE cb != 0 [L215] __cil_tmp55 = s__version - 65280 [L216] COND FALSE !(__cil_tmp55 != 768) [L221] s__type = 4096 [L222] COND FALSE !(s__init_buf___0 == 0) [L234] COND FALSE !(! tmp___4) [L238] COND FALSE !(! tmp___5) [L242] s__state = 4368 [L243] s__ctx__stats__sess_connect ++ [L244] s__init_num = 0 [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND TRUE s__state == 4368 [L248] s__shutdown = 0 [L249] ret = __VERIFIER_nondet_int() [L250] COND TRUE blastFlag == 0 [L251] blastFlag = 1 [L253] COND FALSE !(ret <= 0) [L256] s__state = 4384 [L257] s__init_num = 0 [L258] COND TRUE s__bbio != s__wbio [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND TRUE s__state == 4384 [L264] ret = __VERIFIER_nondet_int() [L265] COND TRUE blastFlag == 1 [L266] blastFlag = 2 [L268] COND FALSE !(ret <= 0) [L271] COND FALSE !(\read(s__hit)) [L274] s__state = 4400 [L276] s__init_num = 0 [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND TRUE s__state == 4400 [L280] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 2 [L285] blastFlag = 3 [L287] COND FALSE !(ret <= 0) [L291] s__state = 4416 [L292] s__init_num = 0 [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND FALSE !(s__state == 4400) [L131] COND FALSE !(s__state == 4401) [L134] COND TRUE s__state == 4416 [L296] ret = __VERIFIER_nondet_int() [L297] COND TRUE blastFlag == 3 [L298] blastFlag = 4 [L300] COND FALSE !(ret <= 0) [L303] s__state = 4432 [L304] s__init_num = 0 [L305] COND FALSE !(! tmp___6) [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND FALSE !(s__state == 4400) [L131] COND FALSE !(s__state == 4401) [L134] COND FALSE !(s__state == 4416) [L137] COND FALSE !(s__state == 4417) [L140] COND TRUE s__state == 4432 [L312] ret = __VERIFIER_nondet_int() [L313] COND TRUE blastFlag == 4 [L544] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. UNSAFE Result, 3.4s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1216 SDtfs, 252 SDslu, 644 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred 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, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 46848 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...