./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33e9ff70181f23aec46a4e91eec467338569fa5a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:56:37,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:37,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:37,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:37,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:37,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:37,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:37,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:37,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:37,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:37,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:37,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:37,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:37,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:37,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:37,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:37,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:37,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:37,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:37,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:37,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:37,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:37,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:37,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:37,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:37,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:37,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:37,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:37,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:37,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:37,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:37,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:37,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:37,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:37,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:37,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:37,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:37,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:37,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:37,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:37,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:37,564 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:56:37,588 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:37,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:37,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:37,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:37,595 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:37,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:37,596 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:37,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:37,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:37,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:37,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:56:37,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:37,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:56:37,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:37,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:37,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:37,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:56:37,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:37,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:37,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:37,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:37,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:37,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:37,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:37,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:56:37,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:56:37,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:56:37,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:56:37,600 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33e9ff70181f23aec46a4e91eec467338569fa5a [2019-11-25 08:56:37,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:37,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:37,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:37,780 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:37,780 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:37,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-25 08:56:37,839 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/data/6ac01eeb7/18be1b2965e143648b74672b7f5ca66d/FLAG74edd6eca [2019-11-25 08:56:38,288 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:38,289 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-25 08:56:38,301 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/data/6ac01eeb7/18be1b2965e143648b74672b7f5ca66d/FLAG74edd6eca [2019-11-25 08:56:38,635 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/data/6ac01eeb7/18be1b2965e143648b74672b7f5ca66d [2019-11-25 08:56:38,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:38,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:38,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:38,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:38,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:38,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:38" (1/1) ... [2019-11-25 08:56:38,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2b1b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:38, skipping insertion in model container [2019-11-25 08:56:38,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:38" (1/1) ... [2019-11-25 08:56:38,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:38,725 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:39,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:39,065 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:39,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:39,132 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:39,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39 WrapperNode [2019-11-25 08:56:39,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:39,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:39,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:39,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:39,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:39,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:39,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:39,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:39,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... [2019-11-25 08:56:39,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:39,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:39,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:39,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:39,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/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-25 08:56:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:39,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:39,424 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:56:40,064 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:56:40,064 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:56:40,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:40,066 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:56:40,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:40 BoogieIcfgContainer [2019-11-25 08:56:40,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:40,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:40,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:40,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:40,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:38" (1/3) ... [2019-11-25 08:56:40,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e380daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:40, skipping insertion in model container [2019-11-25 08:56:40,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:39" (2/3) ... [2019-11-25 08:56:40,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e380daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:40, skipping insertion in model container [2019-11-25 08:56:40,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:40" (3/3) ... [2019-11-25 08:56:40,077 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-1.c [2019-11-25 08:56:40,085 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:40,092 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:56:40,104 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:56:40,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:40,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:56:40,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:40,131 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:40,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:40,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:40,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:40,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-11-25 08:56:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:56:40,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:40,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:40,156 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126500, now seen corresponding path program 1 times [2019-11-25 08:56:40,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:40,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577945573] [2019-11-25 08:56:40,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:40,358 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-25 08:56:40,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577945573] [2019-11-25 08:56:40,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:40,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:40,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074720656] [2019-11-25 08:56:40,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:40,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:40,380 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-11-25 08:56:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:40,703 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-11-25 08:56:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:40,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-25 08:56:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:40,721 INFO L225 Difference]: With dead ends: 332 [2019-11-25 08:56:40,721 INFO L226 Difference]: Without dead ends: 177 [2019-11-25 08:56:40,727 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-25 08:56:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-25 08:56:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-11-25 08:56:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-25 08:56:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-11-25 08:56:40,804 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-11-25 08:56:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:40,806 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-11-25 08:56:40,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-11-25 08:56:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:56:40,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:40,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:40,817 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:40,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296701, now seen corresponding path program 1 times [2019-11-25 08:56:40,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:40,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339866685] [2019-11-25 08:56:40,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:40,924 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-25 08:56:40,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339866685] [2019-11-25 08:56:40,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:40,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:40,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089840731] [2019-11-25 08:56:40,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:40,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:40,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:40,930 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-11-25 08:56:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:41,148 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-11-25 08:56:41,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:41,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-25 08:56:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:41,151 INFO L225 Difference]: With dead ends: 384 [2019-11-25 08:56:41,151 INFO L226 Difference]: Without dead ends: 218 [2019-11-25 08:56:41,153 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-25 08:56:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-25 08:56:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-11-25 08:56:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-25 08:56:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-11-25 08:56:41,178 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-11-25 08:56:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:41,179 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-11-25 08:56:41,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-11-25 08:56:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 08:56:41,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:41,182 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:41,182 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:41,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1767942993, now seen corresponding path program 1 times [2019-11-25 08:56:41,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:41,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849608687] [2019-11-25 08:56:41,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:41,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849608687] [2019-11-25 08:56:41,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:41,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:41,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337417250] [2019-11-25 08:56:41,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:41,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:41,292 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-11-25 08:56:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:41,494 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-11-25 08:56:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:41,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-25 08:56:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:41,499 INFO L225 Difference]: With dead ends: 448 [2019-11-25 08:56:41,499 INFO L226 Difference]: Without dead ends: 243 [2019-11-25 08:56:41,503 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-25 08:56:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-25 08:56:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-25 08:56:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-25 08:56:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-11-25 08:56:41,535 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-11-25 08:56:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:41,538 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-11-25 08:56:41,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-11-25 08:56:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:56:41,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:41,544 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-25 08:56:41,544 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash -409474745, now seen corresponding path program 1 times [2019-11-25 08:56:41,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:41,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503365368] [2019-11-25 08:56:41,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:41,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503365368] [2019-11-25 08:56:41,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:41,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:41,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385916983] [2019-11-25 08:56:41,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:41,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:41,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:41,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:41,649 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-11-25 08:56:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:41,855 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-11-25 08:56:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:41,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:56:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:41,860 INFO L225 Difference]: With dead ends: 525 [2019-11-25 08:56:41,860 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:56:41,861 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-25 08:56:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:56:41,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-11-25 08:56:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-25 08:56:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-11-25 08:56:41,878 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-11-25 08:56:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:41,878 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-11-25 08:56:41,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-11-25 08:56:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:56:41,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:41,880 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:41,880 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1510819865, now seen corresponding path program 1 times [2019-11-25 08:56:41,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:41,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346434844] [2019-11-25 08:56:41,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:56:41,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346434844] [2019-11-25 08:56:41,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:41,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:41,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613413705] [2019-11-25 08:56:41,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:41,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:41,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:41,949 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-11-25 08:56:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:42,113 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-11-25 08:56:42,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:42,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-25 08:56:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:42,116 INFO L225 Difference]: With dead ends: 580 [2019-11-25 08:56:42,116 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:56:42,117 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-25 08:56:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:56:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-25 08:56:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-25 08:56:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-11-25 08:56:42,131 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-11-25 08:56:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:42,131 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-11-25 08:56:42,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-11-25 08:56:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:56:42,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:42,133 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-25 08:56:42,134 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:42,134 INFO L82 PathProgramCache]: Analyzing trace with hash 556901760, now seen corresponding path program 1 times [2019-11-25 08:56:42,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:42,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802000753] [2019-11-25 08:56:42,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:42,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802000753] [2019-11-25 08:56:42,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:42,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:42,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023633844] [2019-11-25 08:56:42,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:42,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:42,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:42,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:42,204 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-11-25 08:56:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:42,383 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-11-25 08:56:42,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:42,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-25 08:56:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:42,386 INFO L225 Difference]: With dead ends: 597 [2019-11-25 08:56:42,386 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:56:42,387 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-25 08:56:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:56:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-25 08:56:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-25 08:56:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-11-25 08:56:42,404 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-11-25 08:56:42,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:42,405 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-11-25 08:56:42,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-11-25 08:56:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:56:42,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:42,410 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:42,410 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 134586867, now seen corresponding path program 1 times [2019-11-25 08:56:42,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:42,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326684802] [2019-11-25 08:56:42,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:56:42,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326684802] [2019-11-25 08:56:42,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:42,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:42,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947070666] [2019-11-25 08:56:42,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:42,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:42,464 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-11-25 08:56:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:42,586 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-11-25 08:56:42,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:42,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-25 08:56:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:42,589 INFO L225 Difference]: With dead ends: 591 [2019-11-25 08:56:42,589 INFO L226 Difference]: Without dead ends: 300 [2019-11-25 08:56:42,589 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-25 08:56:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-25 08:56:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-25 08:56:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-25 08:56:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-25 08:56:42,599 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-11-25 08:56:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:42,600 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-25 08:56:42,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-25 08:56:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:56:42,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:42,601 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:42,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1345174066, now seen corresponding path program 1 times [2019-11-25 08:56:42,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:42,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686916760] [2019-11-25 08:56:42,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-25 08:56:42,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686916760] [2019-11-25 08:56:42,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:42,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:42,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798990687] [2019-11-25 08:56:42,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:42,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:42,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:42,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:42,639 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-11-25 08:56:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:42,755 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-11-25 08:56:42,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:42,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:56:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:42,757 INFO L225 Difference]: With dead ends: 598 [2019-11-25 08:56:42,758 INFO L226 Difference]: Without dead ends: 307 [2019-11-25 08:56:42,758 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-25 08:56:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-25 08:56:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-25 08:56:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-25 08:56:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-11-25 08:56:42,771 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-11-25 08:56:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:42,771 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-11-25 08:56:42,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-11-25 08:56:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:56:42,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:42,772 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:42,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:42,773 INFO L82 PathProgramCache]: Analyzing trace with hash 414047818, now seen corresponding path program 1 times [2019-11-25 08:56:42,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:42,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709266983] [2019-11-25 08:56:42,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:56:42,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709266983] [2019-11-25 08:56:42,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:42,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:42,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362850689] [2019-11-25 08:56:42,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:42,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:42,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:42,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:42,828 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-11-25 08:56:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:42,974 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-11-25 08:56:42,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:42,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:56:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:42,977 INFO L225 Difference]: With dead ends: 638 [2019-11-25 08:56:42,977 INFO L226 Difference]: Without dead ends: 338 [2019-11-25 08:56:42,977 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-25 08:56:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-25 08:56:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-25 08:56:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-25 08:56:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-11-25 08:56:42,988 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-11-25 08:56:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:42,989 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-11-25 08:56:42,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-11-25 08:56:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:56:42,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:42,990 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:42,991 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash -728621130, now seen corresponding path program 1 times [2019-11-25 08:56:42,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:42,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227639108] [2019-11-25 08:56:42,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:56:43,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227639108] [2019-11-25 08:56:43,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:43,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:43,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654158590] [2019-11-25 08:56:43,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:43,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:43,046 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-11-25 08:56:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:43,195 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-11-25 08:56:43,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:43,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:56:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:43,198 INFO L225 Difference]: With dead ends: 667 [2019-11-25 08:56:43,198 INFO L226 Difference]: Without dead ends: 338 [2019-11-25 08:56:43,198 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-25 08:56:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-25 08:56:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-25 08:56:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-25 08:56:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-25 08:56:43,213 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-11-25 08:56:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:43,214 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-25 08:56:43,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-25 08:56:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:56:43,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:43,217 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:43,217 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1946943846, now seen corresponding path program 1 times [2019-11-25 08:56:43,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834128022] [2019-11-25 08:56:43,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:56:43,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834128022] [2019-11-25 08:56:43,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:43,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:43,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418886337] [2019-11-25 08:56:43,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:43,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:43,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:43,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:43,262 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-11-25 08:56:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:43,408 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-11-25 08:56:43,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:43,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-25 08:56:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:43,410 INFO L225 Difference]: With dead ends: 700 [2019-11-25 08:56:43,411 INFO L226 Difference]: Without dead ends: 371 [2019-11-25 08:56:43,411 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-25 08:56:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-25 08:56:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-25 08:56:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-25 08:56:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-11-25 08:56:43,423 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-11-25 08:56:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:43,423 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-11-25 08:56:43,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-11-25 08:56:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:56:43,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:43,425 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:43,425 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:43,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1829577626, now seen corresponding path program 1 times [2019-11-25 08:56:43,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958315218] [2019-11-25 08:56:43,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:56:43,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958315218] [2019-11-25 08:56:43,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:43,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:43,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345460777] [2019-11-25 08:56:43,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:43,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:43,457 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-11-25 08:56:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:43,613 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-11-25 08:56:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:43,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-25 08:56:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:43,616 INFO L225 Difference]: With dead ends: 727 [2019-11-25 08:56:43,616 INFO L226 Difference]: Without dead ends: 371 [2019-11-25 08:56:43,617 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-25 08:56:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-25 08:56:43,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-25 08:56:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-25 08:56:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-11-25 08:56:43,632 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-11-25 08:56:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:43,632 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-11-25 08:56:43,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-11-25 08:56:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:56:43,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:43,634 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:43,634 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:43,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,635 INFO L82 PathProgramCache]: Analyzing trace with hash -932592104, now seen corresponding path program 1 times [2019-11-25 08:56:43,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381636128] [2019-11-25 08:56:43,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:56:43,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381636128] [2019-11-25 08:56:43,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:43,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:43,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903910813] [2019-11-25 08:56:43,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:43,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:43,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:43,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:43,673 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-11-25 08:56:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:43,809 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-11-25 08:56:43,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:43,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:56:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:43,812 INFO L225 Difference]: With dead ends: 744 [2019-11-25 08:56:43,812 INFO L226 Difference]: Without dead ends: 388 [2019-11-25 08:56:43,813 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-25 08:56:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-25 08:56:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-25 08:56:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-25 08:56:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-11-25 08:56:43,829 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-11-25 08:56:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:43,829 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-11-25 08:56:43,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-11-25 08:56:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:56:43,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:43,853 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:43,854 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:43,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1760203780, now seen corresponding path program 1 times [2019-11-25 08:56:43,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914746703] [2019-11-25 08:56:43,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:56:43,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914746703] [2019-11-25 08:56:43,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:43,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:43,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721758927] [2019-11-25 08:56:43,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:43,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:43,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:43,884 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-11-25 08:56:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:44,018 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-11-25 08:56:44,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:44,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:56:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:44,020 INFO L225 Difference]: With dead ends: 765 [2019-11-25 08:56:44,021 INFO L226 Difference]: Without dead ends: 388 [2019-11-25 08:56:44,021 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-25 08:56:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-25 08:56:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-25 08:56:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-25 08:56:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-11-25 08:56:44,035 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-11-25 08:56:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:44,035 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-11-25 08:56:44,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-11-25 08:56:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:56:44,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:44,037 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:44,037 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2108241292, now seen corresponding path program 1 times [2019-11-25 08:56:44,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:44,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014065031] [2019-11-25 08:56:44,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:56:44,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014065031] [2019-11-25 08:56:44,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:44,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:44,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622533584] [2019-11-25 08:56:44,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:44,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:44,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:44,078 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-11-25 08:56:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:44,123 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-11-25 08:56:44,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:44,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:56:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:44,127 INFO L225 Difference]: With dead ends: 1092 [2019-11-25 08:56:44,127 INFO L226 Difference]: Without dead ends: 715 [2019-11-25 08:56:44,128 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-25 08:56:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-25 08:56:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-25 08:56:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-25 08:56:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-11-25 08:56:44,153 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-11-25 08:56:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:44,154 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-11-25 08:56:44,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-11-25 08:56:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:56:44,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:44,156 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:44,156 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash -58853450, now seen corresponding path program 1 times [2019-11-25 08:56:44,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:44,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224581427] [2019-11-25 08:56:44,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:44,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:44,236 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:56:44,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:44 BoogieIcfgContainer [2019-11-25 08:56:44,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:44,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:44,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:44,297 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:44,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:40" (3/4) ... [2019-11-25 08:56:44,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:56:44,403 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0733d9ee-85b2-4210-b464-8646c2021fd2/bin/uautomizer/witness.graphml [2019-11-25 08:56:44,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:44,405 INFO L168 Benchmark]: Toolchain (without parser) took 5765.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 951.5 MB in the beginning and 1.2 GB in the end (delta: -257.8 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,405 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:44,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.48 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-25 08:56:44,406 INFO L168 Benchmark]: Boogie Preprocessor took 36.55 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-25 08:56:44,407 INFO L168 Benchmark]: RCFGBuilder took 841.73 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: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,407 INFO L168 Benchmark]: TraceAbstraction took 4228.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.9 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,407 INFO L168 Benchmark]: Witness Printer took 106.54 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,409 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 493.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.48 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. * Boogie Preprocessor took 36.55 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 841.73 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: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4228.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.9 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * Witness Printer took 106.54 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 611]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int s ; [L617] int tmp ; [L621] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf = __VERIFIER_nondet_int() ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp = __VERIFIER_nondet_long() ; [L45] int cb ; [L46] long num1 ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 ; [L55] int tmp___4 ; [L56] int tmp___5 ; [L57] int tmp___6 ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 ; [L61] int tmp___10 ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L268] s__shutdown = 0 [L269] ret = __VERIFIER_nondet_int() [L270] COND TRUE blastFlag == 0 [L271] blastFlag = 1 [L273] COND FALSE !(ret <= 0) [L276] got_new_session = 1 [L277] s__state = 8496 [L278] s__init_num = 0 [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L282] ret = __VERIFIER_nondet_int() [L283] COND TRUE blastFlag == 1 [L284] blastFlag = 2 [L286] COND FALSE !(ret <= 0) [L289] COND TRUE \read(s__hit) [L290] s__state = 8656 [L294] s__init_num = 0 [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND FALSE !(s__state == 8528) [L148] COND FALSE !(s__state == 8529) [L151] COND FALSE !(s__state == 8544) [L154] COND FALSE !(s__state == 8545) [L157] COND FALSE !(s__state == 8560) [L160] COND FALSE !(s__state == 8561) [L163] COND FALSE !(s__state == 8448) [L166] COND FALSE !(s__state == 8576) [L169] COND FALSE !(s__state == 8577) [L172] COND FALSE !(s__state == 8592) [L175] COND FALSE !(s__state == 8593) [L178] COND FALSE !(s__state == 8608) [L181] COND FALSE !(s__state == 8609) [L184] COND FALSE !(s__state == 8640) [L187] COND FALSE !(s__state == 8641) [L190] COND TRUE s__state == 8656 [L488] s__session__cipher = s__s3__tmp__new_cipher [L489] tmp___9 = __VERIFIER_nondet_int() [L490] COND FALSE !(! tmp___9) [L494] ret = __VERIFIER_nondet_int() [L495] COND TRUE blastFlag == 2 [L496] blastFlag = 3 [L498] COND FALSE !(ret <= 0) [L501] s__state = 8672 [L502] s__init_num = 0 [L503] tmp___10 = __VERIFIER_nondet_int() [L504] COND FALSE !(! tmp___10) [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND FALSE !(s__state == 8528) [L148] COND FALSE !(s__state == 8529) [L151] COND FALSE !(s__state == 8544) [L154] COND FALSE !(s__state == 8545) [L157] COND FALSE !(s__state == 8560) [L160] COND FALSE !(s__state == 8561) [L163] COND FALSE !(s__state == 8448) [L166] COND FALSE !(s__state == 8576) [L169] COND FALSE !(s__state == 8577) [L172] COND FALSE !(s__state == 8592) [L175] COND FALSE !(s__state == 8593) [L178] COND FALSE !(s__state == 8608) [L181] COND FALSE !(s__state == 8609) [L184] COND FALSE !(s__state == 8640) [L187] COND FALSE !(s__state == 8641) [L190] COND FALSE !(s__state == 8656) [L193] COND FALSE !(s__state == 8657) [L196] COND TRUE s__state == 8672 [L511] ret = __VERIFIER_nondet_int() [L512] COND FALSE !(blastFlag == 4) [L515] COND TRUE blastFlag == 3 [L611] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2210 SDtfs, 2216 SDslu, 420 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=15, 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, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1320 ConstructedInterpolants, 0 QuantifiedInterpolants, 218070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 736/736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...