./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:38:43,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:38:43,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:38:43,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:38:43,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:38:43,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:38:43,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:38:43,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:38:43,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:38:43,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:38:43,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:38:43,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:38:43,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:38:43,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:38:43,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:38:43,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:38:43,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:38:43,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:38:43,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:38:43,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:38:43,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:38:43,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:38:43,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:38:43,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:38:43,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:38:43,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:38:43,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:38:43,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:38:43,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:38:43,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:38:43,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:38:43,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:38:43,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:38:43,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:38:43,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:38:43,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:38:43,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:38:43,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:38:43,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:38:43,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:38:43,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:38:43,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:38:43,336 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:38:43,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:38:43,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:38:43,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:38:43,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:38:43,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:38:43,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:38:43,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:38:43,340 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:38:43,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:38:43,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:38:43,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:38:43,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:38:43,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:38:43,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:38:43,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:38:43,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:38:43,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:38:43,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:38:43,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:38:43,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:38:43,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:38:43,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:38:43,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:38:43,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:38:43,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:38:43,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:38:43,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:38:43,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:38:43,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:38:43,344 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:38:43,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:38:43,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:38:43,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f [2022-02-20 14:38:43,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:38:43,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:38:43,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:38:43,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:38:43,572 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:38:43,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2022-02-20 14:38:43,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de530f7a4/d4b99b6e178b4cb6bc72e229f6fff32f/FLAGea6a437b0 [2022-02-20 14:38:43,996 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:38:43,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2022-02-20 14:38:44,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de530f7a4/d4b99b6e178b4cb6bc72e229f6fff32f/FLAGea6a437b0 [2022-02-20 14:38:44,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de530f7a4/d4b99b6e178b4cb6bc72e229f6fff32f [2022-02-20 14:38:44,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:38:44,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:38:44,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:38:44,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:38:44,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:38:44,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6260bebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44, skipping insertion in model container [2022-02-20 14:38:44,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:38:44,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:38:44,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-02-20 14:38:44,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:38:44,188 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:38:44,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-02-20 14:38:44,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:38:44,224 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:38:44,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44 WrapperNode [2022-02-20 14:38:44,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:38:44,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:38:44,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:38:44,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:38:44,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,262 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2022-02-20 14:38:44,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:38:44,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:38:44,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:38:44,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:38:44,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:38:44,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:38:44,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:38:44,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:38:44,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (1/1) ... [2022-02-20 14:38:44,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:38:44,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:38:44,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:38:44,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:38:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:38:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:38:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:38:44,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:38:44,393 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:38:44,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:38:44,593 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:38:44,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:38:44,598 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:38:44,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:38:44 BoogieIcfgContainer [2022-02-20 14:38:44,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:38:44,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:38:44,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:38:44,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:38:44,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:38:44" (1/3) ... [2022-02-20 14:38:44,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f50ad8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:38:44, skipping insertion in model container [2022-02-20 14:38:44,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:38:44" (2/3) ... [2022-02-20 14:38:44,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f50ad8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:38:44, skipping insertion in model container [2022-02-20 14:38:44,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:38:44" (3/3) ... [2022-02-20 14:38:44,619 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-02-20 14:38:44,623 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:38:44,623 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:38:44,676 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:38:44,680 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:38:44,680 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:38:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 14:38:44,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:44,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 14:38:44,718 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash 28699930, now seen corresponding path program 1 times [2022-02-20 14:38:44,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:44,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938284410] [2022-02-20 14:38:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:44,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {49#true} is VALID [2022-02-20 14:38:44,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {51#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} is VALID [2022-02-20 14:38:44,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} assume !false; {51#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} is VALID [2022-02-20 14:38:44,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} assume main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2; {50#false} is VALID [2022-02-20 14:38:44,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {50#false} assume !false; {50#false} is VALID [2022-02-20 14:38:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:38:44,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:44,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938284410] [2022-02-20 14:38:44,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938284410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:44,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:44,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:44,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132858399] [2022-02-20 14:38:44,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 14:38:44,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:44,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:44,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:44,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:44,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:44,921 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:45,080 INFO L93 Difference]: Finished difference Result 131 states and 218 transitions. [2022-02-20 14:38:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:45,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 14:38:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 14:38:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 14:38:45,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 218 transitions. [2022-02-20 14:38:45,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:45,282 INFO L225 Difference]: With dead ends: 131 [2022-02-20 14:38:45,282 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 14:38:45,285 INFO L932 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 [2022-02-20 14:38:45,291 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 59 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:45,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 122 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 14:38:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-02-20 14:38:45,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:45,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,320 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,321 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:45,330 INFO L93 Difference]: Finished difference Result 79 states and 121 transitions. [2022-02-20 14:38:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2022-02-20 14:38:45,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:45,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:45,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 79 states. [2022-02-20 14:38:45,339 INFO L87 Difference]: Start difference. First operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 79 states. [2022-02-20 14:38:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:45,355 INFO L93 Difference]: Finished difference Result 79 states and 121 transitions. [2022-02-20 14:38:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2022-02-20 14:38:45,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:45,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:45,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:45,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2022-02-20 14:38:45,366 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 5 [2022-02-20 14:38:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:45,367 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2022-02-20 14:38:45,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2022-02-20 14:38:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:38:45,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:45,370 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:45,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:38:45,371 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1485309586, now seen corresponding path program 1 times [2022-02-20 14:38:45,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:45,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825676073] [2022-02-20 14:38:45,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:45,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {506#true} is VALID [2022-02-20 14:38:45,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {506#true} is VALID [2022-02-20 14:38:45,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} assume !false; {506#true} is VALID [2022-02-20 14:38:45,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {506#true} is VALID [2022-02-20 14:38:45,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#true} assume 8466 == main_~s__state~0#1; {506#true} is VALID [2022-02-20 14:38:45,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 1; {508#(= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} is VALID [2022-02-20 14:38:45,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {508#(= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} main_~s__state~0#1 := 8496; {508#(= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} is VALID [2022-02-20 14:38:45,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {508#(= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} assume !false; {508#(= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} is VALID [2022-02-20 14:38:45,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {508#(= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} assume main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2; {507#false} is VALID [2022-02-20 14:38:45,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#false} assume !false; {507#false} is VALID [2022-02-20 14:38:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:38:45,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:45,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825676073] [2022-02-20 14:38:45,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825676073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:45,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:45,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:45,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996861132] [2022-02-20 14:38:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:45,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:38:45,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:45,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:45,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:45,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:45,439 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:45,597 INFO L93 Difference]: Finished difference Result 156 states and 246 transitions. [2022-02-20 14:38:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:38:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 14:38:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 14:38:45,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2022-02-20 14:38:45,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:45,745 INFO L225 Difference]: With dead ends: 156 [2022-02-20 14:38:45,745 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 14:38:45,746 INFO L932 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 [2022-02-20 14:38:45,747 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:45,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 161 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 14:38:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-20 14:38:45,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:45,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,758 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,758 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:45,763 INFO L93 Difference]: Finished difference Result 116 states and 175 transitions. [2022-02-20 14:38:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 175 transitions. [2022-02-20 14:38:45,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:45,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:45,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 14:38:45,765 INFO L87 Difference]: Start difference. First operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 14:38:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:45,770 INFO L93 Difference]: Finished difference Result 116 states and 175 transitions. [2022-02-20 14:38:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 175 transitions. [2022-02-20 14:38:45,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:45,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:45,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:45,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 175 transitions. [2022-02-20 14:38:45,778 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 175 transitions. Word has length 10 [2022-02-20 14:38:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:45,779 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 175 transitions. [2022-02-20 14:38:45,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 175 transitions. [2022-02-20 14:38:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:38:45,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:45,781 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:45,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:38:45,781 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1152886494, now seen corresponding path program 1 times [2022-02-20 14:38:45,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:45,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539210848] [2022-02-20 14:38:45,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:45,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:45,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {1123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1123#true} is VALID [2022-02-20 14:38:45,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {1123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {1123#true} is VALID [2022-02-20 14:38:45,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {1123#true} assume !false; {1123#true} is VALID [2022-02-20 14:38:45,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {1123#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {1123#true} is VALID [2022-02-20 14:38:45,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {1123#true} assume 8466 == main_~s__state~0#1; {1123#true} is VALID [2022-02-20 14:38:45,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {1123#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 1; {1123#true} is VALID [2022-02-20 14:38:45,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {1123#true} main_~s__state~0#1 := 8496; {1123#true} is VALID [2022-02-20 14:38:45,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {1123#true} assume !false; {1123#true} is VALID [2022-02-20 14:38:45,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {1123#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {1123#true} is VALID [2022-02-20 14:38:45,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {1123#true} assume !(8466 == main_~s__state~0#1); {1123#true} is VALID [2022-02-20 14:38:45,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1123#true} assume 8496 == main_~s__state~0#1; {1123#true} is VALID [2022-02-20 14:38:45,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {1123#true} assume 1 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {1125#(= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} is VALID [2022-02-20 14:38:45,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {1125#(= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; {1125#(= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} is VALID [2022-02-20 14:38:45,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#(= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} assume !false; {1125#(= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} is VALID [2022-02-20 14:38:45,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#(= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0)} assume main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2; {1124#false} is VALID [2022-02-20 14:38:45,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {1124#false} assume !false; {1124#false} is VALID [2022-02-20 14:38:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:38:45,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:45,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539210848] [2022-02-20 14:38:45,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539210848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:45,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:45,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:45,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303028151] [2022-02-20 14:38:45,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:38:45,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:45,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:45,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:45,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:45,844 INFO L87 Difference]: Start difference. First operand 116 states and 175 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:45,971 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2022-02-20 14:38:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:45,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:38:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 14:38:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 14:38:45,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2022-02-20 14:38:46,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:46,090 INFO L225 Difference]: With dead ends: 230 [2022-02-20 14:38:46,090 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 14:38:46,090 INFO L932 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 [2022-02-20 14:38:46,091 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:46,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 14:38:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-02-20 14:38:46,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:46,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,100 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,100 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,104 INFO L93 Difference]: Finished difference Result 153 states and 230 transitions. [2022-02-20 14:38:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 230 transitions. [2022-02-20 14:38:46,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:46,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:46,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 153 states. [2022-02-20 14:38:46,105 INFO L87 Difference]: Start difference. First operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 153 states. [2022-02-20 14:38:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,109 INFO L93 Difference]: Finished difference Result 153 states and 230 transitions. [2022-02-20 14:38:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 230 transitions. [2022-02-20 14:38:46,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:46,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:46,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:46,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 230 transitions. [2022-02-20 14:38:46,114 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 230 transitions. Word has length 16 [2022-02-20 14:38:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:46,114 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 230 transitions. [2022-02-20 14:38:46,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 230 transitions. [2022-02-20 14:38:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:38:46,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:46,115 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:46,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:38:46,115 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash -77104047, now seen corresponding path program 1 times [2022-02-20 14:38:46,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:46,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682824591] [2022-02-20 14:38:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:46,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {1970#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1970#true} is VALID [2022-02-20 14:38:46,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1970#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {1970#true} is VALID [2022-02-20 14:38:46,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1970#true} assume !false; {1970#true} is VALID [2022-02-20 14:38:46,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {1970#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {1970#true} is VALID [2022-02-20 14:38:46,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {1970#true} assume 8466 == main_~s__state~0#1; {1970#true} is VALID [2022-02-20 14:38:46,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {1970#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 1; {1970#true} is VALID [2022-02-20 14:38:46,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {1970#true} main_~s__state~0#1 := 8496; {1970#true} is VALID [2022-02-20 14:38:46,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {1970#true} assume !false; {1970#true} is VALID [2022-02-20 14:38:46,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1970#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {1970#true} is VALID [2022-02-20 14:38:46,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1970#true} assume !(8466 == main_~s__state~0#1); {1970#true} is VALID [2022-02-20 14:38:46,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {1970#true} assume 8496 == main_~s__state~0#1; {1970#true} is VALID [2022-02-20 14:38:46,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1970#true} assume 1 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {1970#true} is VALID [2022-02-20 14:38:46,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {1970#true} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-20 14:38:46,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !false; {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-20 14:38:46,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-20 14:38:46,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !(8466 == main_~s__state~0#1); {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-20 14:38:46,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !(8496 == main_~s__state~0#1); {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-20 14:38:46,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {1972#(= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !(8512 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1971#false} assume !(8528 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1971#false} assume !(8544 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {1971#false} assume !(8560 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {1971#false} assume !(8576 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {1971#false} assume !(8592 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {1971#false} assume !(8608 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {1971#false} assume !(8640 == main_~s__state~0#1); {1971#false} is VALID [2022-02-20 14:38:46,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {1971#false} assume 8656 == main_~s__state~0#1; {1971#false} is VALID [2022-02-20 14:38:46,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {1971#false} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {1971#false} is VALID [2022-02-20 14:38:46,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {1971#false} main_~s__state~0#1 := 8672; {1971#false} is VALID [2022-02-20 14:38:46,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {1971#false} assume !false; {1971#false} is VALID [2022-02-20 14:38:46,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {1971#false} assume main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2; {1971#false} is VALID [2022-02-20 14:38:46,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {1971#false} assume !false; {1971#false} is VALID [2022-02-20 14:38:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 14:38:46,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:46,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682824591] [2022-02-20 14:38:46,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682824591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:46,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:46,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:46,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887776227] [2022-02-20 14:38:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:46,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:38:46,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:46,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:46,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:46,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:46,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:46,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:46,199 INFO L87 Difference]: Start difference. First operand 153 states and 230 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,292 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-02-20 14:38:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:38:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 14:38:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 14:38:46,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 14:38:46,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:46,366 INFO L225 Difference]: With dead ends: 321 [2022-02-20 14:38:46,366 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 14:38:46,367 INFO L932 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 [2022-02-20 14:38:46,368 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:46,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 14:38:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2022-02-20 14:38:46,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:46,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,375 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,376 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,379 INFO L93 Difference]: Finished difference Result 170 states and 247 transitions. [2022-02-20 14:38:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 247 transitions. [2022-02-20 14:38:46,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:46,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:46,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 170 states. [2022-02-20 14:38:46,380 INFO L87 Difference]: Start difference. First operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 170 states. [2022-02-20 14:38:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,389 INFO L93 Difference]: Finished difference Result 170 states and 247 transitions. [2022-02-20 14:38:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 247 transitions. [2022-02-20 14:38:46,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:46,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:46,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:46,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 246 transitions. [2022-02-20 14:38:46,393 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 246 transitions. Word has length 31 [2022-02-20 14:38:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:46,393 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 246 transitions. [2022-02-20 14:38:46,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 246 transitions. [2022-02-20 14:38:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:38:46,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:46,394 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:46,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:38:46,394 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1611839695, now seen corresponding path program 1 times [2022-02-20 14:38:46,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:46,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728743988] [2022-02-20 14:38:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:46,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {2994#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2994#true} is VALID [2022-02-20 14:38:46,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2994#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {2994#true} is VALID [2022-02-20 14:38:46,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {2994#true} assume !false; {2994#true} is VALID [2022-02-20 14:38:46,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {2994#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2994#true} is VALID [2022-02-20 14:38:46,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {2994#true} assume 8466 == main_~s__state~0#1; {2994#true} is VALID [2022-02-20 14:38:46,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {2994#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 1; {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {2994#true} main_~s__state~0#1 := 8496; {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {2994#true} assume !false; {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {2994#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {2994#true} assume !(8466 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {2994#true} assume 8496 == main_~s__state~0#1; {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {2994#true} assume 1 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {2994#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {2994#true} assume !false; {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {2994#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2994#true} is VALID [2022-02-20 14:38:46,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {2994#true} assume !(8466 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {2994#true} assume !(8496 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#true} assume !(8512 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#true} assume !(8528 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#true} assume !(8544 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {2994#true} assume !(8560 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {2994#true} assume !(8576 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {2994#true} assume !(8592 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {2994#true} assume !(8608 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {2994#true} assume !(8640 == main_~s__state~0#1); {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {2994#true} assume 8656 == main_~s__state~0#1; {2994#true} is VALID [2022-02-20 14:38:46,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {2994#true} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {2994#true} is VALID [2022-02-20 14:38:46,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#true} main_~s__state~0#1 := 8672; {2996#(<= 8672 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-20 14:38:46,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {2996#(<= 8672 |ULTIMATE.start_main_~s__state~0#1|)} assume !false; {2996#(<= 8672 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-20 14:38:46,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {2996#(<= 8672 |ULTIMATE.start_main_~s__state~0#1|)} assume main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2; {2995#false} is VALID [2022-02-20 14:38:46,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {2995#false} assume !false; {2995#false} is VALID [2022-02-20 14:38:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:38:46,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:46,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728743988] [2022-02-20 14:38:46,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728743988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:46,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:46,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:46,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208729913] [2022-02-20 14:38:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:46,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:38:46,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:46,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:46,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:46,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:46,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:46,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:46,481 INFO L87 Difference]: Start difference. First operand 168 states and 246 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,594 INFO L93 Difference]: Finished difference Result 378 states and 567 transitions. [2022-02-20 14:38:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:46,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:38:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-02-20 14:38:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-02-20 14:38:46,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 157 transitions. [2022-02-20 14:38:46,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:46,693 INFO L225 Difference]: With dead ends: 378 [2022-02-20 14:38:46,693 INFO L226 Difference]: Without dead ends: 212 [2022-02-20 14:38:46,694 INFO L932 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 [2022-02-20 14:38:46,694 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:46,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-20 14:38:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2022-02-20 14:38:46,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:46,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,715 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,716 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,720 INFO L93 Difference]: Finished difference Result 212 states and 289 transitions. [2022-02-20 14:38:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2022-02-20 14:38:46,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:46,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:46,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 212 states. [2022-02-20 14:38:46,721 INFO L87 Difference]: Start difference. First operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 212 states. [2022-02-20 14:38:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,725 INFO L93 Difference]: Finished difference Result 212 states and 289 transitions. [2022-02-20 14:38:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2022-02-20 14:38:46,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:46,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:46,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:46,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 285 transitions. [2022-02-20 14:38:46,731 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 285 transitions. Word has length 31 [2022-02-20 14:38:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:46,731 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 285 transitions. [2022-02-20 14:38:46,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 285 transitions. [2022-02-20 14:38:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:38:46,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:46,741 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:46,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:38:46,742 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -359756882, now seen corresponding path program 1 times [2022-02-20 14:38:46,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:46,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66282507] [2022-02-20 14:38:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:46,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {4207#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4207#true} is VALID [2022-02-20 14:38:46,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {4207#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {4207#true} is VALID [2022-02-20 14:38:46,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {4207#true} assume !false; {4207#true} is VALID [2022-02-20 14:38:46,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {4207#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {4207#true} is VALID [2022-02-20 14:38:46,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {4207#true} assume 8466 == main_~s__state~0#1; {4207#true} is VALID [2022-02-20 14:38:46,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {4207#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 1; {4207#true} is VALID [2022-02-20 14:38:46,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {4207#true} main_~s__state~0#1 := 8496; {4207#true} is VALID [2022-02-20 14:38:46,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {4207#true} assume !false; {4207#true} is VALID [2022-02-20 14:38:46,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {4207#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {4207#true} is VALID [2022-02-20 14:38:46,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {4207#true} assume !(8466 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {4207#true} assume 8496 == main_~s__state~0#1; {4207#true} is VALID [2022-02-20 14:38:46,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {4207#true} assume 1 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {4207#true} is VALID [2022-02-20 14:38:46,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {4207#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {4207#true} is VALID [2022-02-20 14:38:46,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {4207#true} assume !false; {4207#true} is VALID [2022-02-20 14:38:46,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {4207#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {4207#true} is VALID [2022-02-20 14:38:46,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {4207#true} assume !(8466 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {4207#true} assume !(8496 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {4207#true} assume !(8512 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {4207#true} assume !(8528 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {4207#true} assume !(8544 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {4207#true} assume !(8560 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {4207#true} assume !(8576 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {4207#true} assume !(8592 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {4207#true} assume !(8608 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {4207#true} assume !(8640 == main_~s__state~0#1); {4207#true} is VALID [2022-02-20 14:38:46,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#true} assume 8656 == main_~s__state~0#1; {4207#true} is VALID [2022-02-20 14:38:46,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#true} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} main_~s__state~0#1 := 8672; {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !false; {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8466 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8496 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8512 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8528 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8544 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8560 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8576 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8592 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8608 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8640 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8656 == main_~s__state~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume 8672 == main_~s__state~0#1; {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(4 == main_~blastFlag~0#1); {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-20 14:38:46,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {4209#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume 5 == main_~blastFlag~0#1; {4208#false} is VALID [2022-02-20 14:38:46,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {4208#false} assume !false; {4208#false} is VALID [2022-02-20 14:38:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:38:46,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:46,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66282507] [2022-02-20 14:38:46,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66282507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:46,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:46,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:46,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175408861] [2022-02-20 14:38:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:46,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:38:46,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:46,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:46,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:46,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:46,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:46,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:46,823 INFO L87 Difference]: Start difference. First operand 207 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:46,931 INFO L93 Difference]: Finished difference Result 414 states and 577 transitions. [2022-02-20 14:38:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:46,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-02-20 14:38:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2022-02-20 14:38:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2022-02-20 14:38:46,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 193 transitions. [2022-02-20 14:38:47,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:47,047 INFO L225 Difference]: With dead ends: 414 [2022-02-20 14:38:47,047 INFO L226 Difference]: Without dead ends: 264 [2022-02-20 14:38:47,048 INFO L932 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 [2022-02-20 14:38:47,049 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:47,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 163 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-02-20 14:38:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2022-02-20 14:38:47,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:47,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,062 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,062 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,068 INFO L93 Difference]: Finished difference Result 264 states and 361 transitions. [2022-02-20 14:38:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 361 transitions. [2022-02-20 14:38:47,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:47,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:47,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 264 states. [2022-02-20 14:38:47,069 INFO L87 Difference]: Start difference. First operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 264 states. [2022-02-20 14:38:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,074 INFO L93 Difference]: Finished difference Result 264 states and 361 transitions. [2022-02-20 14:38:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 361 transitions. [2022-02-20 14:38:47,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:47,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:47,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:47,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 360 transitions. [2022-02-20 14:38:47,080 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 360 transitions. Word has length 45 [2022-02-20 14:38:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:47,081 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 360 transitions. [2022-02-20 14:38:47,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 360 transitions. [2022-02-20 14:38:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 14:38:47,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:47,081 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 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] [2022-02-20 14:38:47,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:38:47,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1572307813, now seen corresponding path program 1 times [2022-02-20 14:38:47,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:47,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712971714] [2022-02-20 14:38:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:47,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {5635#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5635#true} is VALID [2022-02-20 14:38:47,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {5635#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {5635#true} is VALID [2022-02-20 14:38:47,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {5635#true} assume !false; {5635#true} is VALID [2022-02-20 14:38:47,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {5635#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {5635#true} is VALID [2022-02-20 14:38:47,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {5635#true} assume 8466 == main_~s__state~0#1; {5635#true} is VALID [2022-02-20 14:38:47,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {5635#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 1; {5635#true} is VALID [2022-02-20 14:38:47,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {5635#true} main_~s__state~0#1 := 8496; {5635#true} is VALID [2022-02-20 14:38:47,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {5635#true} assume !false; {5635#true} is VALID [2022-02-20 14:38:47,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {5635#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {5635#true} is VALID [2022-02-20 14:38:47,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {5635#true} assume !(8466 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#true} assume 8496 == main_~s__state~0#1; {5635#true} is VALID [2022-02-20 14:38:47,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#true} assume 1 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {5635#true} is VALID [2022-02-20 14:38:47,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {5635#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {5635#true} is VALID [2022-02-20 14:38:47,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {5635#true} assume !false; {5635#true} is VALID [2022-02-20 14:38:47,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {5635#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {5635#true} is VALID [2022-02-20 14:38:47,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {5635#true} assume !(8466 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {5635#true} assume !(8496 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {5635#true} assume !(8512 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {5635#true} assume !(8528 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {5635#true} assume !(8544 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {5635#true} assume !(8560 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {5635#true} assume !(8576 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {5635#true} assume !(8592 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {5635#true} assume !(8608 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {5635#true} assume !(8640 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {5635#true} assume 8656 == main_~s__state~0#1; {5635#true} is VALID [2022-02-20 14:38:47,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {5635#true} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {5635#true} is VALID [2022-02-20 14:38:47,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {5635#true} main_~s__state~0#1 := 8672; {5635#true} is VALID [2022-02-20 14:38:47,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {5635#true} assume !false; {5635#true} is VALID [2022-02-20 14:38:47,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {5635#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {5635#true} is VALID [2022-02-20 14:38:47,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {5635#true} assume !(8466 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {5635#true} assume !(8496 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {5635#true} assume !(8512 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {5635#true} assume !(8528 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {5635#true} assume !(8544 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {5635#true} assume !(8560 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {5635#true} assume !(8576 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {5635#true} assume !(8592 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {5635#true} assume !(8608 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {5635#true} assume !(8640 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {5635#true} assume !(8656 == main_~s__state~0#1); {5635#true} is VALID [2022-02-20 14:38:47,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {5635#true} assume 8672 == main_~s__state~0#1; {5635#true} is VALID [2022-02-20 14:38:47,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {5635#true} assume !(4 == main_~blastFlag~0#1); {5635#true} is VALID [2022-02-20 14:38:47,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {5635#true} assume !(5 == main_~blastFlag~0#1); {5635#true} is VALID [2022-02-20 14:38:47,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {5635#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {5637#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-20 14:38:47,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {5637#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} assume !false; {5637#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-20 14:38:47,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {5637#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} assume main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2; {5636#false} is VALID [2022-02-20 14:38:47,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {5636#false} assume !false; {5636#false} is VALID [2022-02-20 14:38:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 14:38:47,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:47,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712971714] [2022-02-20 14:38:47,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712971714] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:47,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:47,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:47,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482490696] [2022-02-20 14:38:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:47,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 14:38:47,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:47,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:47,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:47,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:47,153 INFO L87 Difference]: Start difference. First operand 262 states and 360 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,278 INFO L93 Difference]: Finished difference Result 520 states and 731 transitions. [2022-02-20 14:38:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:47,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 14:38:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 14:38:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 14:38:47,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2022-02-20 14:38:47,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:47,363 INFO L225 Difference]: With dead ends: 520 [2022-02-20 14:38:47,363 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 14:38:47,364 INFO L932 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 [2022-02-20 14:38:47,364 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:47,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 80 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 14:38:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2022-02-20 14:38:47,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:47,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,394 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,394 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,396 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-02-20 14:38:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2022-02-20 14:38:47,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:47,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:47,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states. [2022-02-20 14:38:47,397 INFO L87 Difference]: Start difference. First operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states. [2022-02-20 14:38:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,400 INFO L93 Difference]: Finished difference Result 182 states and 235 transitions. [2022-02-20 14:38:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2022-02-20 14:38:47,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:47,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:47,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:47,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2022-02-20 14:38:47,403 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 48 [2022-02-20 14:38:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:47,403 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2022-02-20 14:38:47,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2022-02-20 14:38:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 14:38:47,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:38:47,404 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:47,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:38:47,405 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:38:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:38:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1927293386, now seen corresponding path program 1 times [2022-02-20 14:38:47,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:38:47,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651791502] [2022-02-20 14:38:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:38:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:38:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:38:47,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {6901#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6901#true} is VALID [2022-02-20 14:38:47,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {6901#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_~s__state~0#1, main_~s__hit~0#1, main_~s__verify_mode~0#1, main_~s__session__peer~0#1, main_~s__s3__tmp__new_cipher__algorithms~0#1, main_~buf~0#1, main_~cb~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~s__verify_mode~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~s__session__peer~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~s__s3__tmp__new_cipher__algorithms~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~buf~0#1;havoc main_~cb~0#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {6901#true} is VALID [2022-02-20 14:38:47,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {6901#true} assume !false; {6901#true} is VALID [2022-02-20 14:38:47,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {6901#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6901#true} is VALID [2022-02-20 14:38:47,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {6901#true} assume 8466 == main_~s__state~0#1; {6901#true} is VALID [2022-02-20 14:38:47,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {6901#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 1; {6901#true} is VALID [2022-02-20 14:38:47,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {6901#true} main_~s__state~0#1 := 8496; {6901#true} is VALID [2022-02-20 14:38:47,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {6901#true} assume !false; {6901#true} is VALID [2022-02-20 14:38:47,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {6901#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6901#true} is VALID [2022-02-20 14:38:47,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {6901#true} assume !(8466 == main_~s__state~0#1); {6901#true} is VALID [2022-02-20 14:38:47,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {6901#true} assume 8496 == main_~s__state~0#1; {6901#true} is VALID [2022-02-20 14:38:47,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {6901#true} assume 1 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {6901#true} is VALID [2022-02-20 14:38:47,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {6901#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !false; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8466 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8496 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8512 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8528 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8544 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8560 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8576 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8592 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8608 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8640 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume 8656 == main_~s__state~0#1; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} main_~s__state~0#1 := 8672; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !false; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8466 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8496 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8512 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8528 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8544 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8560 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8576 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8592 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8608 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8640 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8656 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume 8672 == main_~s__state~0#1; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(4 == main_~blastFlag~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(5 == main_~blastFlag~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !false; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8466 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8496 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8512 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8528 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8544 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8560 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8576 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8592 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8608 == main_~s__state~0#1); {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume 8640 == main_~s__state~0#1; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume 3 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 4; {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-20 14:38:47,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {6903#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656; {6902#false} is VALID [2022-02-20 14:38:47,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {6902#false} assume !false; {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 60: Hoare triple {6902#false} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 61: Hoare triple {6902#false} assume !(8466 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 62: Hoare triple {6902#false} assume !(8496 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 63: Hoare triple {6902#false} assume !(8512 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 64: Hoare triple {6902#false} assume !(8528 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 65: Hoare triple {6902#false} assume !(8544 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 66: Hoare triple {6902#false} assume !(8560 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 67: Hoare triple {6902#false} assume !(8576 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,470 INFO L290 TraceCheckUtils]: 68: Hoare triple {6902#false} assume !(8592 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,471 INFO L290 TraceCheckUtils]: 69: Hoare triple {6902#false} assume !(8608 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,471 INFO L290 TraceCheckUtils]: 70: Hoare triple {6902#false} assume !(8640 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,471 INFO L290 TraceCheckUtils]: 71: Hoare triple {6902#false} assume !(8656 == main_~s__state~0#1); {6902#false} is VALID [2022-02-20 14:38:47,471 INFO L290 TraceCheckUtils]: 72: Hoare triple {6902#false} assume 8672 == main_~s__state~0#1; {6902#false} is VALID [2022-02-20 14:38:47,471 INFO L290 TraceCheckUtils]: 73: Hoare triple {6902#false} assume !(4 == main_~blastFlag~0#1); {6902#false} is VALID [2022-02-20 14:38:47,471 INFO L290 TraceCheckUtils]: 74: Hoare triple {6902#false} assume 5 == main_~blastFlag~0#1; {6902#false} is VALID [2022-02-20 14:38:47,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {6902#false} assume !false; {6902#false} is VALID [2022-02-20 14:38:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 14:38:47,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:38:47,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651791502] [2022-02-20 14:38:47,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651791502] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:38:47,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:38:47,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:38:47,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309639772] [2022-02-20 14:38:47,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:38:47,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 14:38:47,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:38:47,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:47,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:38:47,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:38:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:38:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:38:47,501 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,560 INFO L93 Difference]: Finished difference Result 271 states and 328 transitions. [2022-02-20 14:38:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:38:47,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-20 14:38:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:38:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 14:38:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 14:38:47,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-02-20 14:38:47,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:38:47,620 INFO L225 Difference]: With dead ends: 271 [2022-02-20 14:38:47,620 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:38:47,620 INFO L932 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 [2022-02-20 14:38:47,621 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:38:47,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:38:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:38:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:38:47,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:38:47,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,622 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,622 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,623 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:38:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:38:47,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:47,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:47,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:38:47,623 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:38:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:38:47,624 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:38:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:38:47,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:47,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:38:47,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:38:47,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:38:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:38:47,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-02-20 14:38:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:38:47,625 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:38:47,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:38:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:38:47,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:38:47,627 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:38:47,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:38:47,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:38:47,868 INFO L861 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-02-20 14:38:47,869 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 130) no Hoare annotation was computed. [2022-02-20 14:38:47,869 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 207) no Hoare annotation was computed. [2022-02-20 14:38:47,869 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 186) no Hoare annotation was computed. [2022-02-20 14:38:47,869 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 122) no Hoare annotation was computed. [2022-02-20 14:38:47,869 INFO L854 garLoopResultBuilder]: At program point L85(lines 84 195) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_main_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 0)) (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 2)) (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 1)) (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 3)))) [2022-02-20 14:38:47,869 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 211) no Hoare annotation was computed. [2022-02-20 14:38:47,869 INFO L854 garLoopResultBuilder]: At program point L77(lines 76 199) the Hoare annotation is: (let ((.cse0 (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 0)) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 1) .cse0) (and (not (= |ULTIMATE.start_main_~s__hit~0#1| 0)) (= |ULTIMATE.start_main_~blastFlag~0#1| 3) .cse0) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 2) .cse0))) [2022-02-20 14:38:47,870 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 215) no Hoare annotation was computed. [2022-02-20 14:38:47,870 INFO L854 garLoopResultBuilder]: At program point L69(lines 68 203) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:38:47,870 INFO L854 garLoopResultBuilder]: At program point L61(lines 60 207) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:38:47,870 INFO L854 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-02-20 14:38:47,871 INFO L854 garLoopResultBuilder]: At program point L53(lines 52 211) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,871 INFO L854 garLoopResultBuilder]: At program point L45(lines 44 215) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,871 INFO L861 garLoopResultBuilder]: At program point L228(lines 20 229) the Hoare annotation is: true [2022-02-20 14:38:47,871 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 197) no Hoare annotation was computed. [2022-02-20 14:38:47,871 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 201) no Hoare annotation was computed. [2022-02-20 14:38:47,871 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 86 195) no Hoare annotation was computed. [2022-02-20 14:38:47,871 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 205) no Hoare annotation was computed. [2022-02-20 14:38:47,872 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 86 195) no Hoare annotation was computed. [2022-02-20 14:38:47,872 INFO L854 garLoopResultBuilder]: At program point L188(lines 34 223) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 3))) (or (= |ULTIMATE.start_main_~blastFlag~0#1| 1) (and (not (= |ULTIMATE.start_main_~s__hit~0#1| 0)) .cse0 (<= 8640 |ULTIMATE.start_main_~s__state~0#1|)) (= |ULTIMATE.start_main_~blastFlag~0#1| 2) (and (<= 8672 |ULTIMATE.start_main_~s__state~0#1|) .cse0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0))) [2022-02-20 14:38:47,872 INFO L858 garLoopResultBuilder]: For program point L56(lines 56 209) no Hoare annotation was computed. [2022-02-20 14:38:47,872 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-02-20 14:38:47,872 INFO L854 garLoopResultBuilder]: At program point L81(lines 80 197) the Hoare annotation is: (let ((.cse0 (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~blastFlag~0#1| 0)) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 1) .cse0) (and (not (= |ULTIMATE.start_main_~s__hit~0#1| 0)) (= |ULTIMATE.start_main_~blastFlag~0#1| 3) .cse0) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 2) .cse0))) [2022-02-20 14:38:47,872 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 213) no Hoare annotation was computed. [2022-02-20 14:38:47,873 INFO L854 garLoopResultBuilder]: At program point L73(lines 72 201) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,873 INFO L854 garLoopResultBuilder]: At program point L65(lines 64 205) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,873 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:38:47,873 INFO L854 garLoopResultBuilder]: At program point L57(lines 56 209) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,873 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 92) no Hoare annotation was computed. [2022-02-20 14:38:47,873 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2022-02-20 14:38:47,873 INFO L858 garLoopResultBuilder]: For program point L181-1(lines 86 195) no Hoare annotation was computed. [2022-02-20 14:38:47,874 INFO L854 garLoopResultBuilder]: At program point L49(lines 48 213) the Hoare annotation is: (let ((.cse0 (= (+ (- 8512) |ULTIMATE.start_main_~s__state~0#1|) 0))) (or (and .cse0 (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) (and (= |ULTIMATE.start_main_~blastFlag~0#1| 0) .cse0) (and (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) .cse0))) [2022-02-20 14:38:47,874 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 216) no Hoare annotation was computed. [2022-02-20 14:38:47,874 INFO L854 garLoopResultBuilder]: At program point L132(lines 125 134) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,874 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:38:47,874 INFO L854 garLoopResultBuilder]: At program point L124(lines 117 135) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,874 INFO L858 garLoopResultBuilder]: For program point L174-1(lines 174 176) no Hoare annotation was computed. [2022-02-20 14:38:47,874 INFO L854 garLoopResultBuilder]: At program point L42(lines 41 216) the Hoare annotation is: (or (= (+ (- 2) |ULTIMATE.start_main_~blastFlag~0#1|) 0) (= |ULTIMATE.start_main_~blastFlag~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 0)) [2022-02-20 14:38:47,874 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 135) no Hoare annotation was computed. [2022-02-20 14:38:47,874 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 195) no Hoare annotation was computed. [2022-02-20 14:38:47,875 INFO L858 garLoopResultBuilder]: For program point L76(lines 76 199) no Hoare annotation was computed. [2022-02-20 14:38:47,875 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 203) no Hoare annotation was computed. [2022-02-20 14:38:47,875 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-02-20 14:38:47,877 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:38:47,878 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:38:47,880 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:38:47,880 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 14:38:47,881 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 14:38:47,882 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 14:38:47,883 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:38:47,883 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 14:38:47,884 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 14:38:47,884 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 14:38:47,884 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 14:38:47,884 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 14:38:47,884 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 14:38:47,884 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 14:38:47,885 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 14:38:47,885 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 14:38:47,885 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 14:38:47,885 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 14:38:47,885 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 14:38:47,885 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 14:38:47,886 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 14:38:47,886 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 14:38:47,886 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 14:38:47,886 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 14:38:47,886 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 14:38:47,886 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 14:38:47,887 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 14:38:47,887 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 14:38:47,887 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:38:47,888 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:38:47,889 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-02-20 14:38:47,889 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-02-20 14:38:47,889 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 14:38:47,889 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-02-20 14:38:47,889 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-02-20 14:38:47,889 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 14:38:47,889 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 14:38:47,889 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:38:47,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:38:47 BoogieIcfgContainer [2022-02-20 14:38:47,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:38:47,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:38:47,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:38:47,901 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:38:47,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:38:44" (3/4) ... [2022-02-20 14:38:47,904 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:38:47,912 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 14:38:47,913 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 14:38:47,913 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:38:47,913 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:38:47,944 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:38:47,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:38:47,945 INFO L158 Benchmark]: Toolchain (without parser) took 3929.80ms. Allocated memory was 92.3MB in the beginning and 136.3MB in the end (delta: 44.0MB). Free memory was 59.6MB in the beginning and 48.0MB in the end (delta: 11.6MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-02-20 14:38:47,945 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:38:47,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.50ms. Allocated memory is still 92.3MB. Free memory was 59.4MB in the beginning and 67.5MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:38:47,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 92.3MB. Free memory was 67.5MB in the beginning and 65.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:38:47,946 INFO L158 Benchmark]: Boogie Preprocessor took 32.93ms. Allocated memory is still 92.3MB. Free memory was 65.6MB in the beginning and 64.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:38:47,946 INFO L158 Benchmark]: RCFGBuilder took 301.84ms. Allocated memory is still 92.3MB. Free memory was 64.5MB in the beginning and 50.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 14:38:47,946 INFO L158 Benchmark]: TraceAbstraction took 3300.47ms. Allocated memory was 92.3MB in the beginning and 136.3MB in the end (delta: 44.0MB). Free memory was 49.8MB in the beginning and 51.1MB in the end (delta: -1.3MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2022-02-20 14:38:47,947 INFO L158 Benchmark]: Witness Printer took 43.02ms. Allocated memory is still 136.3MB. Free memory was 51.1MB in the beginning and 48.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:38:47,948 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.50ms. Allocated memory is still 92.3MB. Free memory was 59.4MB in the beginning and 67.5MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 92.3MB. Free memory was 67.5MB in the beginning and 65.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.93ms. Allocated memory is still 92.3MB. Free memory was 65.6MB in the beginning and 64.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.84ms. Allocated memory is still 92.3MB. Free memory was 64.5MB in the beginning and 50.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3300.47ms. Allocated memory was 92.3MB in the beginning and 136.3MB in the end (delta: 44.0MB). Free memory was 49.8MB in the beginning and 51.1MB in the end (delta: -1.3MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * Witness Printer took 43.02ms. Allocated memory is still 136.3MB. Free memory was 51.1MB in the beginning and 48.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 227]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 992 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 671 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 85 NumberOfFragments, 298 HoareAnnotationTreeSize, 18 FomulaSimplifications, 124 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 218/218 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag == 0) || (8672 <= s__state && blastFlag == 2)) || (8672 <= s__state && blastFlag == 1)) || (8672 <= s__state && blastFlag == 3) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag == 0) || (blastFlag == 1 && 8640 <= s__state)) || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || (blastFlag == 2 && 8640 <= s__state) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag == 0) || (blastFlag == 1 && 8640 <= s__state)) || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || (blastFlag == 2 && 8640 <= s__state) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((-8512 + s__state == 0 && -1 + blastFlag == 0) || (blastFlag == 0 && -8512 + s__state == 0)) || (-2 + blastFlag == 0 && -8512 + s__state == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((blastFlag == 1 || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || blastFlag == 2) || (8672 <= s__state && blastFlag == 3)) || blastFlag == 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 || blastFlag == 0) || -1 + blastFlag == 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 14:38:47,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE