./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f0681106713dda8f6af7535e98def966db59035 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:27:00,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:27:00,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:27:00,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:27:00,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:27:00,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:27:00,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:27:00,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:27:00,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:27:00,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:27:00,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:27:00,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:27:00,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:27:00,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:27:00,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:27:00,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:27:00,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:27:00,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:27:00,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:27:00,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:27:00,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:27:00,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:27:00,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:27:00,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:27:00,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:27:00,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:27:00,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:27:00,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:27:00,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:27:00,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:27:00,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:27:00,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:27:00,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:27:00,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:27:00,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:27:00,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:27:00,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:27:00,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:27:00,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:27:00,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:27:00,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:27:00,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 20:27:00,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:27:00,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:27:00,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:27:00,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:27:00,342 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:27:00,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:27:00,345 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:27:00,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:27:00,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:27:00,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:27:00,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:27:00,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:27:00,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:27:00,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:27:00,346 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:27:00,346 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:27:00,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:27:00,347 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:27:00,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:27:00,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:27:00,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:27:00,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:27:00,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:27:00,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:00,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:27:00,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:27:00,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:27:00,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:27:00,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:27:00,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:27:00,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:27:00,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> 8f0681106713dda8f6af7535e98def966db59035 [2019-11-28 20:27:00,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:27:00,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:27:00,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:27:00,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:27:00,685 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:27:00,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c [2019-11-28 20:27:00,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978aca187/265084f095df452e929f1cc472c8efdb/FLAGd8af71a1c [2019-11-28 20:27:01,219 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:27:01,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c [2019-11-28 20:27:01,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978aca187/265084f095df452e929f1cc472c8efdb/FLAGd8af71a1c [2019-11-28 20:27:01,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978aca187/265084f095df452e929f1cc472c8efdb [2019-11-28 20:27:01,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:27:01,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:27:01,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:01,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:27:01,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:27:01,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:01" (1/1) ... [2019-11-28 20:27:01,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e892c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:01, skipping insertion in model container [2019-11-28 20:27:01,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:01" (1/1) ... [2019-11-28 20:27:01,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:27:01,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:27:01,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:01,943 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:27:02,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:02,047 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:27:02,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02 WrapperNode [2019-11-28 20:27:02,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:02,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:02,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:27:02,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:27:02,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:02,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:27:02,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:27:02,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:27:02,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... [2019-11-28 20:27:02,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:27:02,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:27:02,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:27:02,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:27:02,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:27:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:27:02,374 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 20:27:02,888 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 20:27:02,889 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 20:27:02,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:27:02,891 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 20:27:02,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:02 BoogieIcfgContainer [2019-11-28 20:27:02,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:27:02,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:27:02,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:27:02,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:27:02,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:27:01" (1/3) ... [2019-11-28 20:27:02,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7380007e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:02, skipping insertion in model container [2019-11-28 20:27:02,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:02" (2/3) ... [2019-11-28 20:27:02,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7380007e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:02, skipping insertion in model container [2019-11-28 20:27:02,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:02" (3/3) ... [2019-11-28 20:27:02,900 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.BV.c.cil-2a.c [2019-11-28 20:27:02,911 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:27:02,918 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-28 20:27:02,931 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-28 20:27:02,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:27:02,959 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:27:02,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:27:02,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:27:02,961 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:27:02,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:27:02,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:27:02,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:27:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-11-28 20:27:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:27:02,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:02,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:02,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2028058964, now seen corresponding path program 1 times [2019-11-28 20:27:03,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:03,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701361107] [2019-11-28 20:27:03,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:03,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701361107] [2019-11-28 20:27:03,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:03,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:03,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352187042] [2019-11-28 20:27:03,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:03,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:03,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:03,230 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 3 states. [2019-11-28 20:27:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:03,439 INFO L93 Difference]: Finished difference Result 317 states and 492 transitions. [2019-11-28 20:27:03,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:03,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 20:27:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:03,455 INFO L225 Difference]: With dead ends: 317 [2019-11-28 20:27:03,455 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 20:27:03,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 20:27:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-28 20:27:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 20:27:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2019-11-28 20:27:03,527 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 17 [2019-11-28 20:27:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:03,528 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2019-11-28 20:27:03,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2019-11-28 20:27:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:27:03,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:03,531 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:03,532 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1356148411, now seen corresponding path program 1 times [2019-11-28 20:27:03,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:03,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022442348] [2019-11-28 20:27:03,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:03,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022442348] [2019-11-28 20:27:03,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:03,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:03,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741904772] [2019-11-28 20:27:03,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:03,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:03,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:03,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:03,710 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand 3 states. [2019-11-28 20:27:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:03,903 INFO L93 Difference]: Finished difference Result 313 states and 441 transitions. [2019-11-28 20:27:03,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:03,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 20:27:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:03,906 INFO L225 Difference]: With dead ends: 313 [2019-11-28 20:27:03,907 INFO L226 Difference]: Without dead ends: 170 [2019-11-28 20:27:03,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-28 20:27:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-11-28 20:27:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-28 20:27:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 232 transitions. [2019-11-28 20:27:03,923 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 232 transitions. Word has length 30 [2019-11-28 20:27:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:03,924 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 232 transitions. [2019-11-28 20:27:03,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 232 transitions. [2019-11-28 20:27:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 20:27:03,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:03,926 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:03,927 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:03,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1330709916, now seen corresponding path program 1 times [2019-11-28 20:27:03,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:03,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287629908] [2019-11-28 20:27:03,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:27:04,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287629908] [2019-11-28 20:27:04,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:04,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:04,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998058941] [2019-11-28 20:27:04,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:04,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:04,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:04,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:04,023 INFO L87 Difference]: Start difference. First operand 167 states and 232 transitions. Second operand 3 states. [2019-11-28 20:27:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:04,189 INFO L93 Difference]: Finished difference Result 346 states and 487 transitions. [2019-11-28 20:27:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:04,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 20:27:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:04,192 INFO L225 Difference]: With dead ends: 346 [2019-11-28 20:27:04,192 INFO L226 Difference]: Without dead ends: 188 [2019-11-28 20:27:04,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-28 20:27:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2019-11-28 20:27:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 20:27:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 254 transitions. [2019-11-28 20:27:04,211 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 254 transitions. Word has length 44 [2019-11-28 20:27:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:04,211 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 254 transitions. [2019-11-28 20:27:04,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 254 transitions. [2019-11-28 20:27:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 20:27:04,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:04,215 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:04,216 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash 272957344, now seen corresponding path program 1 times [2019-11-28 20:27:04,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:04,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118493046] [2019-11-28 20:27:04,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 20:27:04,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118493046] [2019-11-28 20:27:04,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:04,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:27:04,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897472319] [2019-11-28 20:27:04,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:04,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:04,341 INFO L87 Difference]: Start difference. First operand 184 states and 254 transitions. Second operand 3 states. [2019-11-28 20:27:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:04,547 INFO L93 Difference]: Finished difference Result 411 states and 586 transitions. [2019-11-28 20:27:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:04,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-28 20:27:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:04,550 INFO L225 Difference]: With dead ends: 411 [2019-11-28 20:27:04,550 INFO L226 Difference]: Without dead ends: 234 [2019-11-28 20:27:04,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-28 20:27:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 225. [2019-11-28 20:27:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-28 20:27:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2019-11-28 20:27:04,565 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 61 [2019-11-28 20:27:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:04,565 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2019-11-28 20:27:04,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2019-11-28 20:27:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 20:27:04,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:04,568 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:04,568 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1315390558, now seen corresponding path program 1 times [2019-11-28 20:27:04,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:04,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528787923] [2019-11-28 20:27:04,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 20:27:04,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528787923] [2019-11-28 20:27:04,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:04,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:27:04,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071947347] [2019-11-28 20:27:04,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:04,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:04,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:04,639 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2019-11-28 20:27:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:04,654 INFO L93 Difference]: Finished difference Result 225 states and 304 transitions. [2019-11-28 20:27:04,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:04,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-28 20:27:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:04,656 INFO L225 Difference]: With dead ends: 225 [2019-11-28 20:27:04,657 INFO L226 Difference]: Without dead ends: 224 [2019-11-28 20:27:04,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-28 20:27:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-11-28 20:27:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 20:27:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 303 transitions. [2019-11-28 20:27:04,668 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 303 transitions. Word has length 61 [2019-11-28 20:27:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:04,669 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 303 transitions. [2019-11-28 20:27:04,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 303 transitions. [2019-11-28 20:27:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 20:27:04,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:04,671 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:04,672 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:27:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2122401317, now seen corresponding path program 1 times [2019-11-28 20:27:04,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:04,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405191391] [2019-11-28 20:27:04,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:27:04,765 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:27:04,765 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:27:04,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:27:04 BoogieIcfgContainer [2019-11-28 20:27:04,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:27:04,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:27:04,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:27:04,818 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:27:04,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:02" (3/4) ... [2019-11-28 20:27:04,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:27:04,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:27:04,825 INFO L168 Benchmark]: Toolchain (without parser) took 3305.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 956.3 MB in the beginning and 892.0 MB in the end (delta: 64.3 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:04,826 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:04,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:04,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:04,828 INFO L168 Benchmark]: Boogie Preprocessor took 37.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:04,829 INFO L168 Benchmark]: RCFGBuilder took 745.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:04,830 INFO L168 Benchmark]: TraceAbstraction took 1923.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 183.8 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:27:04,830 INFO L168 Benchmark]: Witness Printer took 5.07 ms. Allocated memory is still 1.2 GB. Free memory is still 892.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:27:04,834 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 528.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 745.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1923.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 183.8 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.07 ms. Allocated memory is still 1.2 GB. Free memory is still 892.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 307]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 219. Possible FailurePath: [L628] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] int s__version = __VERIFIER_nondet_int(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L28] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] int tmp___1 ; [L52] int tmp___2 ; [L53] int tmp___3 ; [L54] int tmp___4 ; [L55] int tmp___5 ; [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int ag_Z = __VERIFIER_nondet_int(); [L64] unsigned int ag_V ; [L65] unsigned int ag_W ; [L66] int __retres62 ; [L69] ag_V = 2U [L70] ag_W = 5U [L71] s__state = 12292 [L72] blastFlag = 0 [L73] tmp = __VERIFIER_nondet_int() [L74] cb = 0 [L75] ret = -1 [L76] skip = 0 [L77] tmp___0 = 0 [L78] COND TRUE s__info_callback != 0 [L79] cb = s__info_callback [L87] s__in_handshake = s__in_handshake + 1 [L88] tmp___1 = __VERIFIER_nondet_int() [L89] COND FALSE !(tmp___1 & 12288) [L100] COND TRUE 1 [L102] state = s__state [L103] COND TRUE s__state == 12292 [L206] s__new_session = 1 [L207] s__state = 4096 [L208] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L213] s__server = 0 [L214] COND TRUE cb != 0 [L219] COND FALSE !((s__version & 65280) != 768) [L225] s__type = 4096 [L226] COND FALSE !(s__init_buf___0 == 0) [L245] tmp___4 = __VERIFIER_nondet_int() [L246] COND FALSE !(! tmp___4) [L252] tmp___5 = __VERIFIER_nondet_int() [L253] COND FALSE !(! tmp___5) [L259] s__state = 4368 [L260] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L261] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND TRUE s__state == 4368 [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND TRUE blastFlag == 0 [L268] blastFlag = 1 [L272] COND FALSE !(ret <= 0) [L277] s__state = 4384 [L278] s__init_num = 0 [L279] COND TRUE s__bbio != s__wbio [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND TRUE s__state == 4384 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L298] COND FALSE !(\read(s__hit)) [L301] s__state = 4400 [L303] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND TRUE s__state == 4400 [L307] s__s3__tmp__new_cipher__algorithms - 256 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 18 error locations. Result: UNSAFE, OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1063 SDtfs, 263 SDslu, 493 SDs, 0 SdLazy, 413 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 21036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 101/101 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...