./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/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_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/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-678e011 [2019-11-20 10:58:03,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:58:03,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:58:03,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:58:03,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:58:03,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:58:03,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:58:03,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:58:03,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:58:03,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:58:03,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:58:03,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:58:03,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:58:03,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:58:03,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:58:03,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:58:03,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:58:03,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:58:03,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:58:03,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:58:03,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:58:03,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:58:03,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:58:03,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:58:03,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:58:03,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:58:03,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:58:03,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:58:03,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:58:03,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:58:03,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:58:03,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:58:03,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:58:03,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:58:03,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:58:03,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:58:03,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:58:03,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:58:03,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:58:03,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:58:03,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:58:03,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:58:03,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:58:03,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:58:03,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:58:03,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:58:03,413 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:58:03,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:58:03,414 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:58:03,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:58:03,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:58:03,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:58:03,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:58:03,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:58:03,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:58:03,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:58:03,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:58:03,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:58:03,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:58:03,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:58:03,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:58:03,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:58:03,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:58:03,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:58:03,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:58:03,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:58:03,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:58:03,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:58:03,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:58:03,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:58:03,421 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_79def272-2e3f-45d4-953d-29b18a6f2a45/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-20 10:58:03,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:58:03,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:58:03,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:58:03,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:58:03,633 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:58:03,634 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-20 10:58:03,695 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/data/f9eb3d50a/456f57aeddd847dcb54c914667577eaa/FLAG3d3fdea28 [2019-11-20 10:58:04,141 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:58:04,141 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-20 10:58:04,152 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/data/f9eb3d50a/456f57aeddd847dcb54c914667577eaa/FLAG3d3fdea28 [2019-11-20 10:58:04,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/data/f9eb3d50a/456f57aeddd847dcb54c914667577eaa [2019-11-20 10:58:04,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:58:04,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:58:04,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:58:04,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:58:04,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:58:04,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:04,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b68eb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04, skipping insertion in model container [2019-11-20 10:58:04,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:04,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:58:04,546 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:58:04,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:58:04,885 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:58:04,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:58:04,960 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:58:04,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04 WrapperNode [2019-11-20 10:58:04,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:58:04,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:58:04,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:58:04,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:58:04,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:04,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:58:05,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:58:05,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:58:05,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:58:05,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... [2019-11-20 10:58:05,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:58:05,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:58:05,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:58:05,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:58:05,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/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-20 10:58:05,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:58:05,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:58:05,295 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:58:06,029 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 10:58:06,030 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 10:58:06,031 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:58:06,032 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:58:06,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:06 BoogieIcfgContainer [2019-11-20 10:58:06,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:58:06,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:58:06,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:58:06,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:58:06,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:58:04" (1/3) ... [2019-11-20 10:58:06,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6192208a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:06, skipping insertion in model container [2019-11-20 10:58:06,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:04" (2/3) ... [2019-11-20 10:58:06,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6192208a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:06, skipping insertion in model container [2019-11-20 10:58:06,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:06" (3/3) ... [2019-11-20 10:58:06,042 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-1.c [2019-11-20 10:58:06,053 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:58:06,061 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:58:06,074 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:58:06,103 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:58:06,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:58:06,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:58:06,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:58:06,104 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:58:06,104 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:58:06,104 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:58:06,104 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:58:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-11-20 10:58:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 10:58:06,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:06,136 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-20 10:58:06,137 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126500, now seen corresponding path program 1 times [2019-11-20 10:58:06,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:06,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210819115] [2019-11-20 10:58:06,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:06,394 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-20 10:58:06,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210819115] [2019-11-20 10:58:06,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:06,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:06,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947093989] [2019-11-20 10:58:06,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:06,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:06,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:06,421 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-11-20 10:58:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:06,842 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-11-20 10:58:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:06,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 10:58:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:06,871 INFO L225 Difference]: With dead ends: 332 [2019-11-20 10:58:06,872 INFO L226 Difference]: Without dead ends: 177 [2019-11-20 10:58:06,882 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-20 10:58:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-20 10:58:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-11-20 10:58:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:58:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-11-20 10:58:06,987 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-11-20 10:58:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:06,989 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-11-20 10:58:06,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-11-20 10:58:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 10:58:06,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:06,999 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-20 10:58:07,000 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296701, now seen corresponding path program 1 times [2019-11-20 10:58:07,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:07,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709535487] [2019-11-20 10:58:07,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:07,152 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-20 10:58:07,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709535487] [2019-11-20 10:58:07,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:07,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:07,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309151568] [2019-11-20 10:58:07,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:07,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:07,157 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-11-20 10:58:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:07,395 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-11-20 10:58:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:07,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-20 10:58:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:07,399 INFO L225 Difference]: With dead ends: 384 [2019-11-20 10:58:07,399 INFO L226 Difference]: Without dead ends: 218 [2019-11-20 10:58:07,401 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-20 10:58:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-20 10:58:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-11-20 10:58:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-20 10:58:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-11-20 10:58:07,421 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-11-20 10:58:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:07,422 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-11-20 10:58:07,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-11-20 10:58:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 10:58:07,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:07,426 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-20 10:58:07,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1767942993, now seen corresponding path program 1 times [2019-11-20 10:58:07,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:07,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723700462] [2019-11-20 10:58:07,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:07,536 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-20 10:58:07,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723700462] [2019-11-20 10:58:07,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:07,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:07,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370527016] [2019-11-20 10:58:07,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:07,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:07,541 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-11-20 10:58:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:07,797 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-11-20 10:58:07,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:07,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 10:58:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:07,803 INFO L225 Difference]: With dead ends: 448 [2019-11-20 10:58:07,804 INFO L226 Difference]: Without dead ends: 243 [2019-11-20 10:58:07,805 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-20 10:58:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-20 10:58:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-20 10:58:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 10:58:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-11-20 10:58:07,824 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-11-20 10:58:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:07,825 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-11-20 10:58:07,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-11-20 10:58:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 10:58:07,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:07,829 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-20 10:58:07,829 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash -409474745, now seen corresponding path program 1 times [2019-11-20 10:58:07,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:07,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617539265] [2019-11-20 10:58:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:07,930 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-20 10:58:07,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617539265] [2019-11-20 10:58:07,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:07,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:07,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247347393] [2019-11-20 10:58:07,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:07,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:07,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:07,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:07,935 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-11-20 10:58:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:08,215 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-11-20 10:58:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:08,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 10:58:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:08,221 INFO L225 Difference]: With dead ends: 525 [2019-11-20 10:58:08,221 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 10:58:08,222 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-20 10:58:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 10:58:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-11-20 10:58:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-20 10:58:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-11-20 10:58:08,241 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-11-20 10:58:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:08,242 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-11-20 10:58:08,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-11-20 10:58:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:58:08,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:08,247 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-20 10:58:08,248 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1510819865, now seen corresponding path program 1 times [2019-11-20 10:58:08,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:08,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003112522] [2019-11-20 10:58:08,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:08,295 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-20 10:58:08,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003112522] [2019-11-20 10:58:08,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:08,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:08,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087832284] [2019-11-20 10:58:08,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:08,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:08,297 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-11-20 10:58:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:08,413 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-11-20 10:58:08,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:08,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-20 10:58:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:08,417 INFO L225 Difference]: With dead ends: 580 [2019-11-20 10:58:08,417 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 10:58:08,418 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-20 10:58:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 10:58:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-20 10:58:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-20 10:58:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-11-20 10:58:08,431 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-11-20 10:58:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:08,431 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-11-20 10:58:08,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-11-20 10:58:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:58:08,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:08,434 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-20 10:58:08,434 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash 556901760, now seen corresponding path program 1 times [2019-11-20 10:58:08,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:08,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384246235] [2019-11-20 10:58:08,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:08,526 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-20 10:58:08,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384246235] [2019-11-20 10:58:08,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:08,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:08,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455884699] [2019-11-20 10:58:08,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:08,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:08,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:08,529 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-11-20 10:58:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:08,723 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-11-20 10:58:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:08,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-20 10:58:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:08,726 INFO L225 Difference]: With dead ends: 597 [2019-11-20 10:58:08,726 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 10:58:08,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-20 10:58:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 10:58:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-20 10:58:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-20 10:58:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-11-20 10:58:08,740 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-11-20 10:58:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:08,740 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-11-20 10:58:08,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-11-20 10:58:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:58:08,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:08,742 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-20 10:58:08,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 134586867, now seen corresponding path program 1 times [2019-11-20 10:58:08,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:08,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148581812] [2019-11-20 10:58:08,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:08,786 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-20 10:58:08,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148581812] [2019-11-20 10:58:08,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:08,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:08,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79266800] [2019-11-20 10:58:08,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:08,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:08,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:08,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:08,789 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-11-20 10:58:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:08,935 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-11-20 10:58:08,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:08,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-20 10:58:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:08,938 INFO L225 Difference]: With dead ends: 591 [2019-11-20 10:58:08,939 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 10:58:08,939 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-20 10:58:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 10:58:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-20 10:58:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-20 10:58:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-20 10:58:08,952 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-11-20 10:58:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:08,953 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-20 10:58:08,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-20 10:58:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:58:08,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:08,955 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-20 10:58:08,955 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:08,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:08,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1345174066, now seen corresponding path program 1 times [2019-11-20 10:58:08,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:08,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001005247] [2019-11-20 10:58:08,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:08,997 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-20 10:58:08,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001005247] [2019-11-20 10:58:08,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:08,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:08,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993606948] [2019-11-20 10:58:08,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:08,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:09,000 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-11-20 10:58:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:09,123 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-11-20 10:58:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:09,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 10:58:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:09,126 INFO L225 Difference]: With dead ends: 598 [2019-11-20 10:58:09,126 INFO L226 Difference]: Without dead ends: 307 [2019-11-20 10:58:09,127 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-20 10:58:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-20 10:58:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-20 10:58:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-20 10:58:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-11-20 10:58:09,139 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-11-20 10:58:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:09,139 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-11-20 10:58:09,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-11-20 10:58:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:58:09,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:09,141 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-20 10:58:09,142 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash 414047818, now seen corresponding path program 1 times [2019-11-20 10:58:09,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:09,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633278505] [2019-11-20 10:58:09,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:09,208 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-20 10:58:09,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633278505] [2019-11-20 10:58:09,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:09,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:09,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882113404] [2019-11-20 10:58:09,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:09,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:09,215 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-11-20 10:58:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:09,370 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-11-20 10:58:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:09,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 10:58:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:09,373 INFO L225 Difference]: With dead ends: 638 [2019-11-20 10:58:09,374 INFO L226 Difference]: Without dead ends: 338 [2019-11-20 10:58:09,374 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-20 10:58:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-20 10:58:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-20 10:58:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-20 10:58:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-11-20 10:58:09,389 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-11-20 10:58:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:09,390 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-11-20 10:58:09,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-11-20 10:58:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:58:09,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:09,392 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-20 10:58:09,392 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:09,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash -728621130, now seen corresponding path program 1 times [2019-11-20 10:58:09,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:09,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235431995] [2019-11-20 10:58:09,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:09,443 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-20 10:58:09,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235431995] [2019-11-20 10:58:09,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:09,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:09,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489277702] [2019-11-20 10:58:09,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:09,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:09,447 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-11-20 10:58:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:09,628 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-11-20 10:58:09,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:09,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 10:58:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:09,631 INFO L225 Difference]: With dead ends: 667 [2019-11-20 10:58:09,631 INFO L226 Difference]: Without dead ends: 338 [2019-11-20 10:58:09,632 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-20 10:58:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-20 10:58:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-20 10:58:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-20 10:58:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-20 10:58:09,647 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-11-20 10:58:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:09,648 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-20 10:58:09,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-20 10:58:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 10:58:09,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:09,650 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-20 10:58:09,651 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1946943846, now seen corresponding path program 1 times [2019-11-20 10:58:09,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:09,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99116113] [2019-11-20 10:58:09,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:09,711 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-20 10:58:09,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99116113] [2019-11-20 10:58:09,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:09,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:09,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671180495] [2019-11-20 10:58:09,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:09,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:09,713 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-11-20 10:58:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:09,910 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-11-20 10:58:09,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:09,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 10:58:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:09,914 INFO L225 Difference]: With dead ends: 700 [2019-11-20 10:58:09,915 INFO L226 Difference]: Without dead ends: 371 [2019-11-20 10:58:09,915 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-20 10:58:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-20 10:58:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-20 10:58:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-20 10:58:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-11-20 10:58:09,933 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-11-20 10:58:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:09,933 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-11-20 10:58:09,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-11-20 10:58:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:58:09,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:09,936 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-20 10:58:09,936 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1829577626, now seen corresponding path program 1 times [2019-11-20 10:58:09,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:09,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713513051] [2019-11-20 10:58:09,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:09,979 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-20 10:58:09,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713513051] [2019-11-20 10:58:09,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:09,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:09,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719085823] [2019-11-20 10:58:09,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:09,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:09,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:09,982 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-11-20 10:58:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:10,176 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-11-20 10:58:10,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:10,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 10:58:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:10,179 INFO L225 Difference]: With dead ends: 727 [2019-11-20 10:58:10,179 INFO L226 Difference]: Without dead ends: 371 [2019-11-20 10:58:10,180 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-20 10:58:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-20 10:58:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-20 10:58:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-20 10:58:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-11-20 10:58:10,200 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-11-20 10:58:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:10,200 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-11-20 10:58:10,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-11-20 10:58:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 10:58:10,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:10,203 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-20 10:58:10,203 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash -932592104, now seen corresponding path program 1 times [2019-11-20 10:58:10,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:10,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418717693] [2019-11-20 10:58:10,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:10,244 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-20 10:58:10,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418717693] [2019-11-20 10:58:10,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:10,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:10,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570892025] [2019-11-20 10:58:10,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:10,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:10,247 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-11-20 10:58:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:10,421 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-11-20 10:58:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:10,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 10:58:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:10,425 INFO L225 Difference]: With dead ends: 744 [2019-11-20 10:58:10,425 INFO L226 Difference]: Without dead ends: 388 [2019-11-20 10:58:10,426 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-20 10:58:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-20 10:58:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-20 10:58:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 10:58:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-11-20 10:58:10,443 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-11-20 10:58:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:10,443 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-11-20 10:58:10,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-11-20 10:58:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 10:58:10,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:10,448 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-20 10:58:10,448 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:10,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1760203780, now seen corresponding path program 1 times [2019-11-20 10:58:10,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:10,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249900484] [2019-11-20 10:58:10,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:10,496 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-20 10:58:10,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249900484] [2019-11-20 10:58:10,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:10,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:10,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228141887] [2019-11-20 10:58:10,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:10,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:10,499 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-11-20 10:58:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:10,684 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-11-20 10:58:10,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:10,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-20 10:58:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:10,688 INFO L225 Difference]: With dead ends: 765 [2019-11-20 10:58:10,688 INFO L226 Difference]: Without dead ends: 388 [2019-11-20 10:58:10,689 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-20 10:58:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-20 10:58:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-20 10:58:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 10:58:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-11-20 10:58:10,708 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-11-20 10:58:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:10,709 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-11-20 10:58:10,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-11-20 10:58:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 10:58:10,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:10,711 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-20 10:58:10,712 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2108241292, now seen corresponding path program 1 times [2019-11-20 10:58:10,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:10,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762843409] [2019-11-20 10:58:10,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:10,767 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-20 10:58:10,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762843409] [2019-11-20 10:58:10,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:10,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:58:10,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428063113] [2019-11-20 10:58:10,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:10,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:10,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:10,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:10,770 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-11-20 10:58:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:10,840 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-11-20 10:58:10,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:10,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 10:58:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:10,846 INFO L225 Difference]: With dead ends: 1092 [2019-11-20 10:58:10,846 INFO L226 Difference]: Without dead ends: 715 [2019-11-20 10:58:10,847 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-20 10:58:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-20 10:58:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-20 10:58:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-20 10:58:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-11-20 10:58:10,882 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-11-20 10:58:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:10,883 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-11-20 10:58:10,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-11-20 10:58:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 10:58:10,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:10,886 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-20 10:58:10,887 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash -58853450, now seen corresponding path program 1 times [2019-11-20 10:58:10,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:10,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908461472] [2019-11-20 10:58:10,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:58:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:58:11,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:58:11,024 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 10:58:11,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:58:11 BoogieIcfgContainer [2019-11-20 10:58:11,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:58:11,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:58:11,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:58:11,157 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:58:11,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:06" (3/4) ... [2019-11-20 10:58:11,160 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 10:58:11,324 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_79def272-2e3f-45d4-953d-29b18a6f2a45/bin/uautomizer/witness.graphml [2019-11-20 10:58:11,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:58:11,327 INFO L168 Benchmark]: Toolchain (without parser) took 6844.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 944.8 MB in the beginning and 878.6 MB in the end (delta: 66.2 MB). Peak memory consumption was 261.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:11,327 INFO L168 Benchmark]: CDTParser took 0.28 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-20 10:58:11,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:11,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.78 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-20 10:58:11,329 INFO L168 Benchmark]: Boogie Preprocessor took 44.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:11,329 INFO L168 Benchmark]: RCFGBuilder took 962.71 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:11,330 INFO L168 Benchmark]: TraceAbstraction took 5121.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 177.7 MB). Peak memory consumption was 230.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:11,330 INFO L168 Benchmark]: Witness Printer took 167.42 ms. Allocated memory is still 1.2 GB. Free memory was 893.2 MB in the beginning and 878.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:11,332 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.28 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 479.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.78 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 44.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 962.71 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5121.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 177.7 MB). Peak memory consumption was 230.1 MB. Max. memory is 11.5 GB. * Witness Printer took 167.42 ms. Allocated memory is still 1.2 GB. Free memory was 893.2 MB in the beginning and 878.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 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: 5.0s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2210 SDtfs, 2216 SDslu, 420 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s 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...