./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/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 6c347afff8e447ace50221adb149313f25c6a4a0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 16:52:37,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:52:37,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:52:37,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:52:37,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:52:37,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:52:37,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:52:37,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:52:37,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:52:37,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:52:37,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:52:37,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:52:37,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:52:37,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:52:37,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:52:37,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:52:37,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:52:37,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:52:37,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:52:37,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:52:37,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:52:37,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:52:37,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:52:37,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:52:37,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:52:37,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:52:37,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:52:37,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:52:37,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:52:37,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:52:37,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:52:37,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:52:37,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:52:37,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:52:37,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:52:37,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:52:37,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:52:37,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:52:37,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:52:37,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:52:37,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:52:37,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:52:37,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:52:37,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:52:37,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:52:37,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:52:37,545 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:52:37,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:52:37,545 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:52:37,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:52:37,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:52:37,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:52:37,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:52:37,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:52:37,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:52:37,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:52:37,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:52:37,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:52:37,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:52:37,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:52:37,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:52:37,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:52:37,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:52:37,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:52:37,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:52:37,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:52:37,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:52:37,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:52:37,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:52:37,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:52:37,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:52:37,548 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_4850350e-f6fe-4875-b146-2c02eff2d4a3/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 -> 6c347afff8e447ace50221adb149313f25c6a4a0 [2019-12-07 16:52:37,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:52:37,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:52:37,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:52:37,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:52:37,657 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:52:37,657 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c [2019-12-07 16:52:37,694 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/data/b06dca3ad/5c399d15e18a48e6b20ef6394d39a673/FLAGa2b7cbef1 [2019-12-07 16:52:38,166 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:52:38,166 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c [2019-12-07 16:52:38,173 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/data/b06dca3ad/5c399d15e18a48e6b20ef6394d39a673/FLAGa2b7cbef1 [2019-12-07 16:52:38,182 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/data/b06dca3ad/5c399d15e18a48e6b20ef6394d39a673 [2019-12-07 16:52:38,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:52:38,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:52:38,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:52:38,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:52:38,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:52:38,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17574348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38, skipping insertion in model container [2019-12-07 16:52:38,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:52:38,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:52:38,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:52:38,397 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:52:38,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:52:38,442 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:52:38,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38 WrapperNode [2019-12-07 16:52:38,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:52:38,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:52:38,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:52:38,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:52:38,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:52:38,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:52:38,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:52:38,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:52:38,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... [2019-12-07 16:52:38,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:52:38,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:52:38,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:52:38,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:52:38,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/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-12-07 16:52:38,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:52:38,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:52:38,615 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:52:38,914 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 16:52:38,914 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 16:52:38,915 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:52:38,915 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:52:38,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:52:38 BoogieIcfgContainer [2019-12-07 16:52:38,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:52:38,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:52:38,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:52:38,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:52:38,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:52:38" (1/3) ... [2019-12-07 16:52:38,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636f4bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:52:38, skipping insertion in model container [2019-12-07 16:52:38,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:52:38" (2/3) ... [2019-12-07 16:52:38,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636f4bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:52:38, skipping insertion in model container [2019-12-07 16:52:38,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:52:38" (3/3) ... [2019-12-07 16:52:38,920 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-2.c [2019-12-07 16:52:38,927 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:52:38,931 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:52:38,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:52:38,955 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:52:38,955 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:52:38,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:52:38,955 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:52:38,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:52:38,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:52:38,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:52:38,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:52:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-12-07 16:52:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 16:52:38,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:38,974 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] [2019-12-07 16:52:38,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:38,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-12-07 16:52:38,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:38,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554384454] [2019-12-07 16:52:38,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:52:39,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554384454] [2019-12-07 16:52:39,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:39,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:39,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113912136] [2019-12-07 16:52:39,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:39,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:39,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:39,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:39,159 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-12-07 16:52:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:39,314 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-12-07 16:52:39,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:39,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 16:52:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:39,324 INFO L225 Difference]: With dead ends: 327 [2019-12-07 16:52:39,324 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 16:52:39,326 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-12-07 16:52:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 16:52:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-12-07 16:52:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 16:52:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-12-07 16:52:39,362 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-12-07 16:52:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:39,363 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-12-07 16:52:39,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-12-07 16:52:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 16:52:39,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:39,364 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-12-07 16:52:39,365 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-12-07 16:52:39,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:39,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610415053] [2019-12-07 16:52:39,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:52:39,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610415053] [2019-12-07 16:52:39,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:39,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:39,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125794265] [2019-12-07 16:52:39,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:39,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:39,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:39,412 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-12-07 16:52:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:39,544 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-12-07 16:52:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:39,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 16:52:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:39,547 INFO L225 Difference]: With dead ends: 379 [2019-12-07 16:52:39,548 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 16:52:39,549 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-12-07 16:52:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 16:52:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-12-07 16:52:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 16:52:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-12-07 16:52:39,565 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-12-07 16:52:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:39,566 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-12-07 16:52:39,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-12-07 16:52:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:52:39,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:39,569 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] [2019-12-07 16:52:39,570 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-12-07 16:52:39,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:39,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147524596] [2019-12-07 16:52:39,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:52:39,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147524596] [2019-12-07 16:52:39,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:39,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:39,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329849860] [2019-12-07 16:52:39,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:39,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:39,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:39,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:39,627 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-12-07 16:52:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:39,733 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-12-07 16:52:39,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:39,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 16:52:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:39,736 INFO L225 Difference]: With dead ends: 444 [2019-12-07 16:52:39,736 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 16:52:39,737 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-12-07 16:52:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 16:52:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-07 16:52:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 16:52:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-12-07 16:52:39,748 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-12-07 16:52:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:39,748 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-12-07 16:52:39,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-12-07 16:52:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 16:52:39,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:39,751 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] [2019-12-07 16:52:39,751 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:39,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-12-07 16:52:39,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:39,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919438084] [2019-12-07 16:52:39,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:52:39,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919438084] [2019-12-07 16:52:39,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:39,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:39,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937412848] [2019-12-07 16:52:39,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:39,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:39,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:39,788 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-12-07 16:52:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:39,867 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-12-07 16:52:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:39,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 16:52:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:39,869 INFO L225 Difference]: With dead ends: 492 [2019-12-07 16:52:39,869 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 16:52:39,870 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-12-07 16:52:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 16:52:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-12-07 16:52:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 16:52:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-12-07 16:52:39,879 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-12-07 16:52:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:39,879 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-12-07 16:52:39,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-12-07 16:52:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 16:52:39,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:39,880 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] [2019-12-07 16:52:39,880 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-12-07 16:52:39,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:39,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368996245] [2019-12-07 16:52:39,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:52:39,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368996245] [2019-12-07 16:52:39,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:39,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:39,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999801682] [2019-12-07 16:52:39,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:39,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:39,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:39,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:39,916 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-12-07 16:52:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,020 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-12-07 16:52:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 16:52:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,022 INFO L225 Difference]: With dead ends: 551 [2019-12-07 16:52:40,022 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 16:52:40,023 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-12-07 16:52:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 16:52:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-12-07 16:52:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 16:52:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-12-07 16:52:40,034 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-12-07 16:52:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:40,034 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-12-07 16:52:40,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-12-07 16:52:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 16:52:40,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:40,036 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] [2019-12-07 16:52:40,036 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-12-07 16:52:40,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:40,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146978001] [2019-12-07 16:52:40,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:52:40,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146978001] [2019-12-07 16:52:40,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:40,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:40,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056908276] [2019-12-07 16:52:40,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:40,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:40,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:40,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:40,075 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-12-07 16:52:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,165 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-12-07 16:52:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 16:52:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,167 INFO L225 Difference]: With dead ends: 591 [2019-12-07 16:52:40,167 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 16:52:40,168 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-12-07 16:52:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 16:52:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-12-07 16:52:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 16:52:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-12-07 16:52:40,176 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-12-07 16:52:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:40,176 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-12-07 16:52:40,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-12-07 16:52:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 16:52:40,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:40,177 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] [2019-12-07 16:52:40,177 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-12-07 16:52:40,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:40,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034708758] [2019-12-07 16:52:40,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:52:40,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034708758] [2019-12-07 16:52:40,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:40,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:40,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48470605] [2019-12-07 16:52:40,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:40,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:40,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:40,213 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-12-07 16:52:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,317 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-12-07 16:52:40,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 16:52:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,319 INFO L225 Difference]: With dead ends: 593 [2019-12-07 16:52:40,319 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 16:52:40,319 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-12-07 16:52:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 16:52:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-12-07 16:52:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-12-07 16:52:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-12-07 16:52:40,326 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-12-07 16:52:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:40,327 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-12-07 16:52:40,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-12-07 16:52:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 16:52:40,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:40,328 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] [2019-12-07 16:52:40,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-12-07 16:52:40,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:40,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731733031] [2019-12-07 16:52:40,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:52:40,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731733031] [2019-12-07 16:52:40,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:40,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:40,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025069240] [2019-12-07 16:52:40,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:40,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:40,355 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-12-07 16:52:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,427 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-12-07 16:52:40,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 16:52:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,429 INFO L225 Difference]: With dead ends: 594 [2019-12-07 16:52:40,429 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 16:52:40,429 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-12-07 16:52:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 16:52:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-12-07 16:52:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-07 16:52:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-12-07 16:52:40,436 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-12-07 16:52:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:40,436 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-12-07 16:52:40,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-12-07 16:52:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 16:52:40,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:40,437 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] [2019-12-07 16:52:40,438 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-12-07 16:52:40,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:40,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514719518] [2019-12-07 16:52:40,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:52:40,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514719518] [2019-12-07 16:52:40,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:40,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:40,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903799531] [2019-12-07 16:52:40,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:40,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:40,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:40,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:40,465 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-12-07 16:52:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,561 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-12-07 16:52:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 16:52:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,563 INFO L225 Difference]: With dead ends: 634 [2019-12-07 16:52:40,564 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 16:52:40,564 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-12-07 16:52:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 16:52:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 16:52:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 16:52:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-12-07 16:52:40,575 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-12-07 16:52:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:40,575 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-12-07 16:52:40,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-12-07 16:52:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 16:52:40,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:40,577 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] [2019-12-07 16:52:40,577 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-12-07 16:52:40,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:40,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486262408] [2019-12-07 16:52:40,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:52:40,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486262408] [2019-12-07 16:52:40,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:40,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:40,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138902929] [2019-12-07 16:52:40,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:40,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:40,607 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-12-07 16:52:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,704 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-12-07 16:52:40,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 16:52:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,706 INFO L225 Difference]: With dead ends: 663 [2019-12-07 16:52:40,707 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 16:52:40,707 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-12-07 16:52:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 16:52:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 16:52:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 16:52:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-12-07 16:52:40,718 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-12-07 16:52:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:40,719 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-12-07 16:52:40,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-12-07 16:52:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:52:40,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:40,720 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] [2019-12-07 16:52:40,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-12-07 16:52:40,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:40,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964391066] [2019-12-07 16:52:40,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:52:40,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964391066] [2019-12-07 16:52:40,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:40,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:40,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750637207] [2019-12-07 16:52:40,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:40,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:40,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:40,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:40,751 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-12-07 16:52:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,846 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-12-07 16:52:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 16:52:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,848 INFO L225 Difference]: With dead ends: 696 [2019-12-07 16:52:40,848 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 16:52:40,849 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-12-07 16:52:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 16:52:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 16:52:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 16:52:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-12-07 16:52:40,861 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-12-07 16:52:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:40,861 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-12-07 16:52:40,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-12-07 16:52:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 16:52:40,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:40,863 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] [2019-12-07 16:52:40,863 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-12-07 16:52:40,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:40,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168923378] [2019-12-07 16:52:40,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:52:40,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168923378] [2019-12-07 16:52:40,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:40,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:40,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936176127] [2019-12-07 16:52:40,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:40,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:40,890 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-12-07 16:52:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:40,991 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-12-07 16:52:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:40,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 16:52:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:40,993 INFO L225 Difference]: With dead ends: 723 [2019-12-07 16:52:40,993 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 16:52:40,994 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-12-07 16:52:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 16:52:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 16:52:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 16:52:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-12-07 16:52:41,003 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-12-07 16:52:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:41,003 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-12-07 16:52:41,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-12-07 16:52:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 16:52:41,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:41,004 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] [2019-12-07 16:52:41,004 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-12-07 16:52:41,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:41,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687778500] [2019-12-07 16:52:41,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 16:52:41,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687778500] [2019-12-07 16:52:41,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:41,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:41,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487007934] [2019-12-07 16:52:41,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:41,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:41,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:41,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:41,031 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-12-07 16:52:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:41,142 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-12-07 16:52:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:41,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 16:52:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:41,145 INFO L225 Difference]: With dead ends: 741 [2019-12-07 16:52:41,145 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 16:52:41,146 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-12-07 16:52:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 16:52:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-12-07 16:52:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 16:52:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-12-07 16:52:41,162 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-12-07 16:52:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:41,162 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-12-07 16:52:41,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-12-07 16:52:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 16:52:41,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:41,164 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] [2019-12-07 16:52:41,164 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-12-07 16:52:41,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:41,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048427536] [2019-12-07 16:52:41,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:52:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 16:52:41,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048427536] [2019-12-07 16:52:41,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:41,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:52:41,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500158772] [2019-12-07 16:52:41,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:52:41,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:52:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:52:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:52:41,196 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-12-07 16:52:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:52:41,304 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-12-07 16:52:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:52:41,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 16:52:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:52:41,306 INFO L225 Difference]: With dead ends: 762 [2019-12-07 16:52:41,306 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 16:52:41,307 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-12-07 16:52:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 16:52:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-12-07 16:52:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 16:52:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-12-07 16:52:41,320 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-12-07 16:52:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:52:41,321 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-12-07 16:52:41,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:52:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-12-07 16:52:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 16:52:41,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:52:41,322 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] [2019-12-07 16:52:41,322 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:52:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:52:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-12-07 16:52:41,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:52:41,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338088414] [2019-12-07 16:52:41,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:52:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:52:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:52:41,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:52:41,404 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:52:41,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:52:41 BoogieIcfgContainer [2019-12-07 16:52:41,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:52:41,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:52:41,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:52:41,460 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:52:41,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:52:38" (3/4) ... [2019-12-07 16:52:41,462 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:52:41,532 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4850350e-f6fe-4875-b146-2c02eff2d4a3/bin/uautomizer/witness.graphml [2019-12-07 16:52:41,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:52:41,534 INFO L168 Benchmark]: Toolchain (without parser) took 3348.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 944.1 MB in the beginning and 1.3 GB in the end (delta: -325.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:52:41,534 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:52:41,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:52:41,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:52:41,535 INFO L168 Benchmark]: Boogie Preprocessor took 24.60 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-12-07 16:52:41,535 INFO L168 Benchmark]: RCFGBuilder took 413.31 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:52:41,535 INFO L168 Benchmark]: TraceAbstraction took 2543.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -231.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:52:41,536 INFO L168 Benchmark]: Witness Printer took 72.18 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:52:41,537 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 413.31 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2543.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -231.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 72.18 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L612] int s ; [L613] int tmp ; [L617] 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 ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [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 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [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] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND FALSE !(tmp___1 + 12288) [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND TRUE \read(s__hit) [L297] s__state = 8656 [L301] s__init_num = 0 [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND TRUE s__state == 8656 [L490] s__session__cipher = s__s3__tmp__new_cipher [L491] COND FALSE !(! tmp___9) [L495] ret = __VERIFIER_nondet_int() [L496] COND TRUE blastFlag == 2 [L497] blastFlag = 3 [L499] COND FALSE !(ret <= 0) [L502] s__state = 8672 [L503] s__init_num = 0 [L504] COND FALSE !(! tmp___10) [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND FALSE !(s__state == 8656) [L194] COND FALSE !(s__state == 8657) [L197] COND TRUE s__state == 8672 [L511] ret = __VERIFIER_nondet_int() [L512] COND TRUE blastFlag == 3 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1821 SDtfs, 2038 SDslu, 234 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 188237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 636/636 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...