./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_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_4_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 5bcf105899412371d55027b7bb345bc352302907 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:57:04,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:57:04,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:57:04,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:57:04,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:57:04,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:57:04,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:57:04,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:57:04,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:57:05,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:57:05,001 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:57:05,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:57:05,002 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:57:05,003 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:57:05,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:57:05,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:57:05,006 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:57:05,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:57:05,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:57:05,012 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:57:05,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:57:05,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:57:05,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:57:05,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:57:05,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:57:05,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:57:05,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:57:05,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:57:05,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:57:05,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:57:05,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:57:05,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:57:05,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:57:05,024 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:57:05,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:57:05,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:57:05,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:57:05,053 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:57:05,053 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:57:05,055 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:57:05,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:57:05,056 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:57:05,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:57:05,056 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:57:05,056 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:57:05,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:57:05,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:57:05,057 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:57:05,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:57:05,060 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:57:05,060 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:57:05,061 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:57:05,061 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:57:05,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:57:05,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:57:05,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:57:05,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:57:05,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:05,063 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:57:05,063 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:57:05,063 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:57:05,063 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:57:05,064 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:57:05,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:57:05,064 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 -> 5bcf105899412371d55027b7bb345bc352302907 [2019-01-14 14:57:05,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:57:05,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:57:05,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:57:05,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:57:05,140 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:57:05,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_false-unreach-call_true-termination.cil.c [2019-01-14 14:57:05,199 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b55b585e/7fcd5d37ac3d4af0856f2023e8a115d3/FLAGb56968045 [2019-01-14 14:57:05,680 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:57:05,682 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_4_false-unreach-call_true-termination.cil.c [2019-01-14 14:57:05,700 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b55b585e/7fcd5d37ac3d4af0856f2023e8a115d3/FLAGb56968045 [2019-01-14 14:57:05,984 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b55b585e/7fcd5d37ac3d4af0856f2023e8a115d3 [2019-01-14 14:57:05,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:57:05,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:57:05,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:05,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:57:05,996 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:57:05,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:05" (1/1) ... [2019-01-14 14:57:06,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0090cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:05, skipping insertion in model container [2019-01-14 14:57:06,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:05" (1/1) ... [2019-01-14 14:57:06,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:57:06,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:57:06,408 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:06,414 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:57:06,493 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:06,516 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:57:06,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06 WrapperNode [2019-01-14 14:57:06,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:06,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:06,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:57:06,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:57:06,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:06,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:57:06,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:57:06,640 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:57:06,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... [2019-01-14 14:57:06,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:57:06,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:57:06,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:57:06,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:57:06,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:06,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:57:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:57:06,896 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:57:07,851 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 14:57:07,852 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 14:57:07,853 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:57:07,853 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:57:07,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:07 BoogieIcfgContainer [2019-01-14 14:57:07,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:57:07,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:57:07,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:57:07,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:57:07,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:57:05" (1/3) ... [2019-01-14 14:57:07,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2170b2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:07, skipping insertion in model container [2019-01-14 14:57:07,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:06" (2/3) ... [2019-01-14 14:57:07,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2170b2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:07, skipping insertion in model container [2019-01-14 14:57:07,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:07" (3/3) ... [2019-01-14 14:57:07,862 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_false-unreach-call_true-termination.cil.c [2019-01-14 14:57:07,870 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:57:07,877 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:57:07,891 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:57:07,924 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:57:07,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:57:07,925 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:57:07,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:57:07,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:57:07,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:57:07,926 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:57:07,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:57:07,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:57:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-01-14 14:57:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:57:07,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:07,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:07,956 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-01-14 14:57:07,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:07,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:08,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:08,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:08,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:08,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,219 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-01-14 14:57:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:08,578 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-01-14 14:57:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:08,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:57:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:08,592 INFO L225 Difference]: With dead ends: 251 [2019-01-14 14:57:08,592 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 14:57:08,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 14:57:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 14:57:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 14:57:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-01-14 14:57:08,638 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-01-14 14:57:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:08,638 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-01-14 14:57:08,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-01-14 14:57:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 14:57:08,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:08,641 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:08,641 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:08,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-01-14 14:57:08,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:08,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:08,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:08,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:08,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:08,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:08,786 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-01-14 14:57:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:09,346 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-01-14 14:57:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:09,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-14 14:57:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:09,348 INFO L225 Difference]: With dead ends: 237 [2019-01-14 14:57:09,348 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 14:57:09,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 14:57:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-01-14 14:57:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 14:57:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-01-14 14:57:09,362 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-01-14 14:57:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:09,363 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-01-14 14:57:09,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-01-14 14:57:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 14:57:09,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:09,365 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:09,365 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-01-14 14:57:09,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:09,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 14:57:09,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:09,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:09,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:09,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:09,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:09,465 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-01-14 14:57:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:09,727 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-01-14 14:57:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:09,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-14 14:57:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:09,730 INFO L225 Difference]: With dead ends: 270 [2019-01-14 14:57:09,730 INFO L226 Difference]: Without dead ends: 150 [2019-01-14 14:57:09,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-14 14:57:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-01-14 14:57:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 14:57:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-01-14 14:57:09,742 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-01-14 14:57:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:09,743 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-01-14 14:57:09,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-01-14 14:57:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:57:09,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:09,746 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:09,746 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:09,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2019-01-14 14:57:09,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:09,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:09,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:09,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 14:57:09,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:09,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:09,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:09,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:09,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:09,865 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-01-14 14:57:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:10,262 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-01-14 14:57:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:10,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:57:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:10,266 INFO L225 Difference]: With dead ends: 334 [2019-01-14 14:57:10,266 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 14:57:10,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:10,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 14:57:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-01-14 14:57:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-14 14:57:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-01-14 14:57:10,281 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-01-14 14:57:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:10,281 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-01-14 14:57:10,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-01-14 14:57:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:57:10,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:10,284 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:10,285 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2019-01-14 14:57:10,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:10,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:10,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 14:57:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:10,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:10,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:10,364 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-01-14 14:57:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:10,578 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2019-01-14 14:57:10,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:10,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:57:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:10,581 INFO L225 Difference]: With dead ends: 390 [2019-01-14 14:57:10,581 INFO L226 Difference]: Without dead ends: 212 [2019-01-14 14:57:10,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-14 14:57:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-01-14 14:57:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-14 14:57:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-01-14 14:57:10,602 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-01-14 14:57:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:10,605 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-01-14 14:57:10,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-01-14 14:57:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:57:10,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:10,609 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:10,609 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2019-01-14 14:57:10,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:10,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:10,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-14 14:57:10,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:10,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:10,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:10,731 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-01-14 14:57:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:10,973 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-01-14 14:57:10,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:10,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:57:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:10,975 INFO L225 Difference]: With dead ends: 427 [2019-01-14 14:57:10,975 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 14:57:10,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 14:57:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-14 14:57:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-14 14:57:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-01-14 14:57:10,986 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-01-14 14:57:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:10,987 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-01-14 14:57:10,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-01-14 14:57:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 14:57:10,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:10,989 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:10,989 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2019-01-14 14:57:10,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:10,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:10,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:10,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:10,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 14:57:11,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:11,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:11,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:11,078 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-01-14 14:57:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:11,174 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-01-14 14:57:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:11,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 14:57:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:11,184 INFO L225 Difference]: With dead ends: 661 [2019-01-14 14:57:11,189 INFO L226 Difference]: Without dead ends: 443 [2019-01-14 14:57:11,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-01-14 14:57:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-01-14 14:57:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-14 14:57:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-01-14 14:57:11,223 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-01-14 14:57:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:11,223 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-01-14 14:57:11,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-01-14 14:57:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 14:57:11,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:11,229 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:11,231 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2019-01-14 14:57:11,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:11,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:11,391 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 14:57:11,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:57:11 BoogieIcfgContainer [2019-01-14 14:57:11,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:57:11,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:57:11,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:57:11,498 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:57:11,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:07" (3/4) ... [2019-01-14 14:57:11,503 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 14:57:11,655 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:57:11,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:57:11,659 INFO L168 Benchmark]: Toolchain (without parser) took 5670.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:11,661 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:11,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:11,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:11,662 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:11,662 INFO L168 Benchmark]: RCFGBuilder took 1174.61 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:11,663 INFO L168 Benchmark]: TraceAbstraction took 3642.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). Peak memory consumption was 262.0 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:11,663 INFO L168 Benchmark]: Witness Printer took 157.45 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: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:11,665 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 528.06 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1174.61 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3642.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.5 MB). Peak memory consumption was 262.0 MB. Max. memory is 11.5 GB. * Witness Printer took 157.45 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: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 549]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L554] int s ; [L558] 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] unsigned 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 ; [L74] long __cil_tmp65 ; [L78] s__state = initial_state [L79] blastFlag = 0 [L80] tmp = __VERIFIER_nondet_int() [L81] cb = 0 [L82] ret = -1 [L83] skip = 0 [L84] tmp___0 = 0 [L85] COND TRUE s__info_callback != 0 [L86] cb = s__info_callback [L92] s__in_handshake ++ [L93] COND FALSE !(tmp___1 + 12288) [L99] COND TRUE 1 [L101] state = s__state [L102] COND TRUE s__state == 12292 [L204] s__new_session = 1 [L205] s__state = 4096 [L206] s__ctx__stats__sess_connect_renegotiate ++ [L211] s__server = 0 [L212] COND TRUE cb != 0 [L216] __cil_tmp55 = s__version + 65280 [L217] COND FALSE !(__cil_tmp55 != 768) [L222] s__type = 4096 [L223] COND FALSE !(s__init_buf___0 == 0) [L235] COND FALSE !(! tmp___4) [L239] COND FALSE !(! tmp___5) [L243] s__state = 4368 [L244] s__ctx__stats__sess_connect ++ [L245] s__init_num = 0 [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND TRUE s__state == 4368 [L249] s__shutdown = 0 [L250] ret = __VERIFIER_nondet_int() [L251] COND TRUE blastFlag == 0 [L252] blastFlag = 1 [L254] COND FALSE !(ret <= 0) [L257] s__state = 4384 [L258] s__init_num = 0 [L259] COND TRUE s__bbio != s__wbio [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND TRUE s__state == 4384 [L265] ret = __VERIFIER_nondet_int() [L266] COND TRUE blastFlag == 1 [L267] blastFlag = 2 [L269] COND FALSE !(ret <= 0) [L272] COND FALSE !(\read(s__hit)) [L275] s__state = 4400 [L277] s__init_num = 0 [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND TRUE s__state == 4400 [L282] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L283] COND FALSE !(__cil_tmp56 + 256UL) [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 2 [L288] blastFlag = 3 [L294] COND FALSE !(ret <= 0) [L299] s__state = 4416 [L300] s__init_num = 0 [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND TRUE s__state == 4416 [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 3 [L306] blastFlag = 4 [L308] COND FALSE !(ret <= 0) [L311] s__state = 4432 [L312] s__init_num = 0 [L313] COND FALSE !(! tmp___6) [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L320] ret = __VERIFIER_nondet_int() [L321] COND TRUE blastFlag == 4 [L549] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. UNSAFE Result, 3.5s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1223 SDtfs, 255 SDslu, 651 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s 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=443occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 47530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 316/316 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...