./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/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 a8546eefa2f2d2c21cb36b9121195492b8a27fd6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:55:27,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:27,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:27,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:27,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:27,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:27,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:27,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:27,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:27,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:27,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:27,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:27,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:27,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:27,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:27,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:27,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:27,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:27,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:27,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:27,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:27,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:27,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:27,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:27,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:27,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:27,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:27,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:27,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:27,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:27,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:27,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:27,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:27,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:27,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:27,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:27,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:27,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:27,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:27,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:27,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:27,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:55:27,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:27,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:27,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:27,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:27,619 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:27,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:27,619 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:27,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:27,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:27,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:27,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:55:27,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:55:27,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:55:27,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:27,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:55:27,621 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:27,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:55:27,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:27,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:27,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:55:27,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:55:27,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:55:27,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:27,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:55:27,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:55:27,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:55:27,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:55:27,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:55:27,623 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_ebe1ac06-1094-48f1-b669-f145f23fdbc8/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 -> a8546eefa2f2d2c21cb36b9121195492b8a27fd6 [2019-11-25 08:55:27,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:27,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:27,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:27,822 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:27,823 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:27,824 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-25 08:55:27,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/data/3e76be284/356d9d3acc364d8680bdf1aedaa99d54/FLAG8d27a5859 [2019-11-25 08:55:28,338 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:28,338 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-25 08:55:28,353 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/data/3e76be284/356d9d3acc364d8680bdf1aedaa99d54/FLAG8d27a5859 [2019-11-25 08:55:28,661 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/data/3e76be284/356d9d3acc364d8680bdf1aedaa99d54 [2019-11-25 08:55:28,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:28,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:55:28,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:28,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:28,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:28,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:28" (1/1) ... [2019-11-25 08:55:28,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199165bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:28, skipping insertion in model container [2019-11-25 08:55:28,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:28" (1/1) ... [2019-11-25 08:55:28,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:28,715 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:29,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:29,008 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:29,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:29,121 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:29,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29 WrapperNode [2019-11-25 08:55:29,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:29,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:29,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:55:29,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:55:29,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:29,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:29,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:29,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:29,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... [2019-11-25 08:55:29,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:29,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:29,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:29,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:29,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:55:29,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:29,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:29,384 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:55:29,937 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:55:29,937 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:55:29,938 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:29,939 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:55:29,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:29 BoogieIcfgContainer [2019-11-25 08:55:29,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:29,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:55:29,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:55:29,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:55:29,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:55:28" (1/3) ... [2019-11-25 08:55:29,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df2456c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:29, skipping insertion in model container [2019-11-25 08:55:29,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:29" (2/3) ... [2019-11-25 08:55:29,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df2456c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:29, skipping insertion in model container [2019-11-25 08:55:29,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:29" (3/3) ... [2019-11-25 08:55:29,948 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-11-25 08:55:29,956 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:55:29,963 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:55:29,973 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:55:30,011 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:55:30,012 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:55:30,012 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:55:30,014 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:30,014 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:30,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:55:30,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:30,014 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:55:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-25 08:55:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:55:30,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:30,044 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] [2019-11-25 08:55:30,044 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:30,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-25 08:55:30,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:30,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561895655] [2019-11-25 08:55:30,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:30,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561895655] [2019-11-25 08:55:30,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:30,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:55:30,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80447216] [2019-11-25 08:55:30,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:30,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:30,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:30,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:30,264 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-25 08:55:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:30,467 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-25 08:55:30,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:30,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:55:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:30,482 INFO L225 Difference]: With dead ends: 249 [2019-11-25 08:55:30,482 INFO L226 Difference]: Without dead ends: 113 [2019-11-25 08:55:30,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-25 08:55:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-25 08:55:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-25 08:55:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-25 08:55:30,549 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-25 08:55:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:30,549 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-25 08:55:30,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-25 08:55:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:55:30,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:30,554 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:30,555 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-25 08:55:30,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:30,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937994561] [2019-11-25 08:55:30,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:30,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937994561] [2019-11-25 08:55:30,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:30,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:30,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015911333] [2019-11-25 08:55:30,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:30,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:30,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:30,674 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-25 08:55:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:30,818 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-25 08:55:30,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:30,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-25 08:55:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:30,820 INFO L225 Difference]: With dead ends: 235 [2019-11-25 08:55:30,820 INFO L226 Difference]: Without dead ends: 131 [2019-11-25 08:55:30,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-25 08:55:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-25 08:55:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-25 08:55:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-25 08:55:30,837 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-25 08:55:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:30,837 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-25 08:55:30,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-25 08:55:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:55:30,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:30,843 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:30,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-25 08:55:30,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:30,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982991328] [2019-11-25 08:55:30,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:55:30,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982991328] [2019-11-25 08:55:30,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:30,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:30,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734880656] [2019-11-25 08:55:30,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:30,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:30,960 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-25 08:55:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:31,109 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-25 08:55:31,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:31,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:55:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:31,112 INFO L225 Difference]: With dead ends: 268 [2019-11-25 08:55:31,112 INFO L226 Difference]: Without dead ends: 149 [2019-11-25 08:55:31,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-25 08:55:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-25 08:55:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-25 08:55:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-25 08:55:31,124 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-25 08:55:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:31,124 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-25 08:55:31,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-25 08:55:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:55:31,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:31,126 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:31,127 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-25 08:55:31,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:31,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606248198] [2019-11-25 08:55:31,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:55:31,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606248198] [2019-11-25 08:55:31,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:31,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:31,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038964327] [2019-11-25 08:55:31,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:31,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:31,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:31,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:31,233 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-25 08:55:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:31,453 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-25 08:55:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:31,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:55:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:31,456 INFO L225 Difference]: With dead ends: 332 [2019-11-25 08:55:31,456 INFO L226 Difference]: Without dead ends: 195 [2019-11-25 08:55:31,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-25 08:55:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-25 08:55:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 08:55:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-25 08:55:31,482 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-25 08:55:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:31,484 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-25 08:55:31,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-25 08:55:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:55:31,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:31,488 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:31,488 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-25 08:55:31,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:31,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287102214] [2019-11-25 08:55:31,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:55:31,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287102214] [2019-11-25 08:55:31,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:31,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:31,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985366951] [2019-11-25 08:55:31,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:31,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:31,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:31,547 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-25 08:55:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:31,691 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-25 08:55:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:31,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-25 08:55:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:31,694 INFO L225 Difference]: With dead ends: 386 [2019-11-25 08:55:31,694 INFO L226 Difference]: Without dead ends: 209 [2019-11-25 08:55:31,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-25 08:55:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-25 08:55:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-25 08:55:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-25 08:55:31,710 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-25 08:55:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:31,711 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-25 08:55:31,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-25 08:55:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:55:31,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:31,714 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:31,714 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:31,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-25 08:55:31,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:31,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122156696] [2019-11-25 08:55:31,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-25 08:55:31,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122156696] [2019-11-25 08:55:31,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:31,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:31,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116373989] [2019-11-25 08:55:31,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:31,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:31,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:31,799 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-25 08:55:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:31,955 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-25 08:55:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:31,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-25 08:55:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:31,957 INFO L225 Difference]: With dead ends: 425 [2019-11-25 08:55:31,957 INFO L226 Difference]: Without dead ends: 229 [2019-11-25 08:55:31,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-25 08:55:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-25 08:55:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-25 08:55:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-25 08:55:31,968 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-25 08:55:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:31,968 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-25 08:55:31,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-25 08:55:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-25 08:55:31,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:31,981 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:31,981 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-25 08:55:31,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:31,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135852871] [2019-11-25 08:55:31,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-25 08:55:32,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135852871] [2019-11-25 08:55:32,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:32,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845127610] [2019-11-25 08:55:32,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:32,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,068 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-25 08:55:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,106 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-25 08:55:32,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:32,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-25 08:55:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,110 INFO L225 Difference]: With dead ends: 658 [2019-11-25 08:55:32,110 INFO L226 Difference]: Without dead ends: 441 [2019-11-25 08:55:32,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-25 08:55:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-25 08:55:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-25 08:55:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-25 08:55:32,135 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-25 08:55:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-25 08:55:32,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-25 08:55:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:55:32,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,137 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:32,138 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-25 08:55:32,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:32,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081069064] [2019-11-25 08:55:32,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-25 08:55:32,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081069064] [2019-11-25 08:55:32,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:32,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783003579] [2019-11-25 08:55:32,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:32,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:32,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,213 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2019-11-25 08:55:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,252 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2019-11-25 08:55:32,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:32,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:55:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,256 INFO L225 Difference]: With dead ends: 658 [2019-11-25 08:55:32,257 INFO L226 Difference]: Without dead ends: 656 [2019-11-25 08:55:32,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-25 08:55:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-25 08:55:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-25 08:55:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-25 08:55:32,275 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2019-11-25 08:55:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,275 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-25 08:55:32,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-25 08:55:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-25 08:55:32,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,278 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:32,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2019-11-25 08:55:32,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:32,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984949767] [2019-11-25 08:55:32,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-25 08:55:32,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984949767] [2019-11-25 08:55:32,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:32,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239329966] [2019-11-25 08:55:32,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:32,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,344 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-25 08:55:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,501 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2019-11-25 08:55:32,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:32,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-25 08:55:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,506 INFO L225 Difference]: With dead ends: 1383 [2019-11-25 08:55:32,506 INFO L226 Difference]: Without dead ends: 736 [2019-11-25 08:55:32,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-25 08:55:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2019-11-25 08:55:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-11-25 08:55:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2019-11-25 08:55:32,526 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2019-11-25 08:55:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,527 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2019-11-25 08:55:32,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2019-11-25 08:55:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-25 08:55:32,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,530 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:32,530 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2019-11-25 08:55:32,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:32,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270156198] [2019-11-25 08:55:32,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-25 08:55:32,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270156198] [2019-11-25 08:55:32,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:32,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176679866] [2019-11-25 08:55:32,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:32,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,583 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2019-11-25 08:55:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,746 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2019-11-25 08:55:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:32,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-25 08:55:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:32,752 INFO L225 Difference]: With dead ends: 1594 [2019-11-25 08:55:32,752 INFO L226 Difference]: Without dead ends: 875 [2019-11-25 08:55:32,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-11-25 08:55:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2019-11-25 08:55:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-25 08:55:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2019-11-25 08:55:32,776 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2019-11-25 08:55:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:32,776 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2019-11-25 08:55:32,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2019-11-25 08:55:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-25 08:55:32,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:32,780 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:32,780 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:32,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2019-11-25 08:55:32,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:32,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128039427] [2019-11-25 08:55:32,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-25 08:55:32,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128039427] [2019-11-25 08:55:32,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:32,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:32,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210044182] [2019-11-25 08:55:32,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:32,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:32,859 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2019-11-25 08:55:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:32,996 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2019-11-25 08:55:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:32,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-25 08:55:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,002 INFO L225 Difference]: With dead ends: 1765 [2019-11-25 08:55:33,002 INFO L226 Difference]: Without dead ends: 932 [2019-11-25 08:55:33,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-11-25 08:55:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2019-11-25 08:55:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-25 08:55:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2019-11-25 08:55:33,028 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2019-11-25 08:55:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,029 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2019-11-25 08:55:33,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2019-11-25 08:55:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-25 08:55:33,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,033 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2019-11-25 08:55:33,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305192817] [2019-11-25 08:55:33,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-25 08:55:33,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305192817] [2019-11-25 08:55:33,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:33,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726884634] [2019-11-25 08:55:33,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:33,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,111 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2019-11-25 08:55:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,255 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2019-11-25 08:55:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:33,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-25 08:55:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,262 INFO L225 Difference]: With dead ends: 1945 [2019-11-25 08:55:33,262 INFO L226 Difference]: Without dead ends: 1028 [2019-11-25 08:55:33,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-25 08:55:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-11-25 08:55:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-25 08:55:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2019-11-25 08:55:33,292 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2019-11-25 08:55:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,292 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2019-11-25 08:55:33,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2019-11-25 08:55:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-25 08:55:33,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,297 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,297 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2019-11-25 08:55:33,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53426428] [2019-11-25 08:55:33,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-25 08:55:33,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53426428] [2019-11-25 08:55:33,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:33,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024147585] [2019-11-25 08:55:33,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:33,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,378 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2019-11-25 08:55:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,415 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2019-11-25 08:55:33,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:33,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-25 08:55:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,427 INFO L225 Difference]: With dead ends: 3036 [2019-11-25 08:55:33,427 INFO L226 Difference]: Without dead ends: 2026 [2019-11-25 08:55:33,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-11-25 08:55:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2019-11-25 08:55:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-11-25 08:55:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2019-11-25 08:55:33,483 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2019-11-25 08:55:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,483 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2019-11-25 08:55:33,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2019-11-25 08:55:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-25 08:55:33,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,490 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,490 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2019-11-25 08:55:33,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041596196] [2019-11-25 08:55:33,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-25 08:55:33,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041596196] [2019-11-25 08:55:33,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:33,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372116030] [2019-11-25 08:55:33,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:33,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:33,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,578 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2019-11-25 08:55:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:33,778 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2019-11-25 08:55:33,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:33,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-25 08:55:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:33,791 INFO L225 Difference]: With dead ends: 4264 [2019-11-25 08:55:33,792 INFO L226 Difference]: Without dead ends: 2249 [2019-11-25 08:55:33,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-25 08:55:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2019-11-25 08:55:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-11-25 08:55:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2019-11-25 08:55:33,853 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2019-11-25 08:55:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:33,854 INFO L462 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2019-11-25 08:55:33,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2019-11-25 08:55:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-25 08:55:33,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,861 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:33,861 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2019-11-25 08:55:33,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53297537] [2019-11-25 08:55:33,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-25 08:55:33,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53297537] [2019-11-25 08:55:33,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:33,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946585561] [2019-11-25 08:55:33,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:33,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:33,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:33,949 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2019-11-25 08:55:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:34,129 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2019-11-25 08:55:34,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:34,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-25 08:55:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:34,143 INFO L225 Difference]: With dead ends: 4576 [2019-11-25 08:55:34,143 INFO L226 Difference]: Without dead ends: 2348 [2019-11-25 08:55:34,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-11-25 08:55:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2019-11-25 08:55:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-11-25 08:55:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2019-11-25 08:55:34,206 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2019-11-25 08:55:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:34,207 INFO L462 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2019-11-25 08:55:34,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2019-11-25 08:55:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-25 08:55:34,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:34,214 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:34,214 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2019-11-25 08:55:34,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:34,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961867395] [2019-11-25 08:55:34,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:55:34,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961867395] [2019-11-25 08:55:34,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:34,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:34,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364135998] [2019-11-25 08:55:34,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:34,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:34,300 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2019-11-25 08:55:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:34,512 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2019-11-25 08:55:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:34,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-25 08:55:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:34,527 INFO L225 Difference]: With dead ends: 4963 [2019-11-25 08:55:34,527 INFO L226 Difference]: Without dead ends: 2636 [2019-11-25 08:55:34,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-25 08:55:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2019-11-25 08:55:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-11-25 08:55:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2019-11-25 08:55:34,652 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2019-11-25 08:55:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:34,652 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2019-11-25 08:55:34,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2019-11-25 08:55:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-25 08:55:34,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:34,660 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:34,660 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:34,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2019-11-25 08:55:34,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:34,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382529656] [2019-11-25 08:55:34,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:55:34,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382529656] [2019-11-25 08:55:34,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820710240] [2019-11-25 08:55:34,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:34,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:55:34,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-25 08:55:35,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:35,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:55:35,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016921051] [2019-11-25 08:55:35,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:35,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:35,007 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2019-11-25 08:55:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:35,446 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2019-11-25 08:55:35,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:35,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-25 08:55:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:35,477 INFO L225 Difference]: With dead ends: 8082 [2019-11-25 08:55:35,478 INFO L226 Difference]: Without dead ends: 5509 [2019-11-25 08:55:35,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:35,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-11-25 08:55:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2019-11-25 08:55:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-11-25 08:55:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2019-11-25 08:55:35,635 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2019-11-25 08:55:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:35,636 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2019-11-25 08:55:35,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2019-11-25 08:55:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-25 08:55:35,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:35,650 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:35,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:35,855 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:35,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2019-11-25 08:55:35,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:35,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378958779] [2019-11-25 08:55:35,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-25 08:55:36,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378958779] [2019-11-25 08:55:36,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:36,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:36,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493813341] [2019-11-25 08:55:36,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:36,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:36,050 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2019-11-25 08:55:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:36,181 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2019-11-25 08:55:36,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:36,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-25 08:55:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:36,235 INFO L225 Difference]: With dead ends: 12402 [2019-11-25 08:55:36,236 INFO L226 Difference]: Without dead ends: 7294 [2019-11-25 08:55:36,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-11-25 08:55:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2019-11-25 08:55:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-11-25 08:55:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2019-11-25 08:55:36,428 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2019-11-25 08:55:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:36,429 INFO L462 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2019-11-25 08:55:36,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2019-11-25 08:55:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-25 08:55:36,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:36,443 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:36,443 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2019-11-25 08:55:36,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:36,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577440638] [2019-11-25 08:55:36,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-11-25 08:55:36,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577440638] [2019-11-25 08:55:36,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:36,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:36,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073725288] [2019-11-25 08:55:36,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:36,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:36,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:36,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:36,570 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2019-11-25 08:55:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:36,831 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2019-11-25 08:55:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:36,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-11-25 08:55:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:36,846 INFO L225 Difference]: With dead ends: 14569 [2019-11-25 08:55:36,846 INFO L226 Difference]: Without dead ends: 7286 [2019-11-25 08:55:36,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-11-25 08:55:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2019-11-25 08:55:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2019-11-25 08:55:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2019-11-25 08:55:37,100 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2019-11-25 08:55:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:37,101 INFO L462 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2019-11-25 08:55:37,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2019-11-25 08:55:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-25 08:55:37,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:37,113 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:37,113 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2019-11-25 08:55:37,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:37,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332976790] [2019-11-25 08:55:37,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:55:37,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332976790] [2019-11-25 08:55:37,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:37,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:37,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772824742] [2019-11-25 08:55:37,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:37,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:37,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:37,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:37,235 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2019-11-25 08:55:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:37,509 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2019-11-25 08:55:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:37,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-11-25 08:55:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:37,525 INFO L225 Difference]: With dead ends: 13675 [2019-11-25 08:55:37,525 INFO L226 Difference]: Without dead ends: 7415 [2019-11-25 08:55:37,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-11-25 08:55:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2019-11-25 08:55:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2019-11-25 08:55:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2019-11-25 08:55:37,712 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2019-11-25 08:55:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:37,712 INFO L462 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2019-11-25 08:55:37,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2019-11-25 08:55:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-25 08:55:37,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:37,727 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:37,728 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:37,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2019-11-25 08:55:37,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:37,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858216777] [2019-11-25 08:55:37,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:55:37,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858216777] [2019-11-25 08:55:37,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187624414] [2019-11-25 08:55:37,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:38,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:55:38,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-11-25 08:55:38,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:55:38,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:55:38,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496412062] [2019-11-25 08:55:38,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:38,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:38,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:38,316 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 3 states. [2019-11-25 08:55:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:38,423 INFO L93 Difference]: Finished difference Result 15401 states and 19915 transitions. [2019-11-25 08:55:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:38,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-11-25 08:55:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:38,441 INFO L225 Difference]: With dead ends: 15401 [2019-11-25 08:55:38,441 INFO L226 Difference]: Without dead ends: 8799 [2019-11-25 08:55:38,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-11-25 08:55:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 8799. [2019-11-25 08:55:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8799 states. [2019-11-25 08:55:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8799 states to 8799 states and 11356 transitions. [2019-11-25 08:55:38,659 INFO L78 Accepts]: Start accepts. Automaton has 8799 states and 11356 transitions. Word has length 371 [2019-11-25 08:55:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:38,659 INFO L462 AbstractCegarLoop]: Abstraction has 8799 states and 11356 transitions. [2019-11-25 08:55:38,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 8799 states and 11356 transitions. [2019-11-25 08:55:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-25 08:55:38,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:38,677 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:38,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:38,882 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash -106230564, now seen corresponding path program 1 times [2019-11-25 08:55:38,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:38,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12838541] [2019-11-25 08:55:38,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:55:39,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12838541] [2019-11-25 08:55:39,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16989330] [2019-11-25 08:55:39,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:39,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:55:39,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:55:39,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:39,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:55:39,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279812055] [2019-11-25 08:55:39,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:39,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:39,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:39,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:39,355 INFO L87 Difference]: Start difference. First operand 8799 states and 11356 transitions. Second operand 4 states. [2019-11-25 08:55:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:39,773 INFO L93 Difference]: Finished difference Result 19741 states and 25400 transitions. [2019-11-25 08:55:39,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:39,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-25 08:55:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:39,794 INFO L225 Difference]: With dead ends: 19741 [2019-11-25 08:55:39,794 INFO L226 Difference]: Without dead ends: 10934 [2019-11-25 08:55:39,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-11-25 08:55:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2019-11-25 08:55:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-11-25 08:55:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2019-11-25 08:55:40,038 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 373 [2019-11-25 08:55:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:40,039 INFO L462 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2019-11-25 08:55:40,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2019-11-25 08:55:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-25 08:55:40,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:40,062 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:40,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:40,266 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:40,267 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2019-11-25 08:55:40,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:40,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568001520] [2019-11-25 08:55:40,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-25 08:55:40,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568001520] [2019-11-25 08:55:40,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:40,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:40,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512057422] [2019-11-25 08:55:40,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:40,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:40,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:40,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:40,431 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2019-11-25 08:55:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:40,660 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2019-11-25 08:55:40,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:40,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-25 08:55:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:40,667 INFO L225 Difference]: With dead ends: 18222 [2019-11-25 08:55:40,668 INFO L226 Difference]: Without dead ends: 3798 [2019-11-25 08:55:40,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-11-25 08:55:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2019-11-25 08:55:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-11-25 08:55:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2019-11-25 08:55:40,763 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2019-11-25 08:55:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:40,764 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2019-11-25 08:55:40,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2019-11-25 08:55:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-25 08:55:40,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:40,776 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:40,776 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2019-11-25 08:55:40,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:40,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293583082] [2019-11-25 08:55:40,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-25 08:55:41,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293583082] [2019-11-25 08:55:41,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216073335] [2019-11-25 08:55:41,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:41,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:55:41,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-25 08:55:41,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:41,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:55:41,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089206070] [2019-11-25 08:55:41,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:41,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:41,361 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2019-11-25 08:55:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:41,549 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2019-11-25 08:55:41,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:41,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-11-25 08:55:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:41,550 INFO L225 Difference]: With dead ends: 3784 [2019-11-25 08:55:41,551 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:55:41,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:55:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:55:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:55:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:55:41,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-11-25 08:55:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:41,555 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:55:41,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:55:41,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:55:41,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:41,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:55:42,210 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 96 [2019-11-25 08:55:43,148 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-11-25 08:55:43,565 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-11-25 08:55:43,829 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 490) no Hoare annotation was computed. [2019-11-25 08:55:43,829 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 501) no Hoare annotation was computed. [2019-11-25 08:55:43,829 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 512) no Hoare annotation was computed. [2019-11-25 08:55:43,829 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-25 08:55:43,829 INFO L444 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-25 08:55:43,830 INFO L440 ceAbstractionStarter]: At program point L136(lines 132 502) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-25 08:55:43,830 INFO L447 ceAbstractionStarter]: At program point L533(lines 95 534) the Hoare annotation is: true [2019-11-25 08:55:43,830 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-11-25 08:55:43,830 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 239) no Hoare annotation was computed. [2019-11-25 08:55:43,830 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 269 273) no Hoare annotation was computed. [2019-11-25 08:55:43,830 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 306) no Hoare annotation was computed. [2019-11-25 08:55:43,830 INFO L440 ceAbstractionStarter]: At program point L204(lines 102 512) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0) (and .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1))) [2019-11-25 08:55:43,830 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 489) no Hoare annotation was computed. [2019-11-25 08:55:43,830 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 500) no Hoare annotation was computed. [2019-11-25 08:55:43,830 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 511) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 490) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 473) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 449) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 419) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L405-1(lines 405 419) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L438-2(lines 438 449) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 488) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 499) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 510) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L538(lines 538 540) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L538-2(lines 538 540) no Hoare annotation was computed. [2019-11-25 08:55:43,831 INFO L440 ceAbstractionStarter]: At program point L142(lines 138 500) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-25 08:55:43,831 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 343) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L209(lines 209 211) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L209-2(lines 209 211) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 377) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 487) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 498) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 509) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 415) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 488) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 446) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L278-1(lines 278 288) no Hoare annotation was computed. [2019-11-25 08:55:43,832 INFO L447 ceAbstractionStarter]: At program point L543(lines 10 545) the Hoare annotation is: true [2019-11-25 08:55:43,832 INFO L440 ceAbstractionStarter]: At program point L312(lines 74 544) the Hoare annotation is: false [2019-11-25 08:55:43,832 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 486) no Hoare annotation was computed. [2019-11-25 08:55:43,833 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 497) no Hoare annotation was computed. [2019-11-25 08:55:43,833 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 508) no Hoare annotation was computed. [2019-11-25 08:55:43,833 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 217) no Hoare annotation was computed. [2019-11-25 08:55:43,833 INFO L440 ceAbstractionStarter]: At program point L148(lines 144 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse3 .cse2))) [2019-11-25 08:55:43,833 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-11-25 08:55:43,833 INFO L440 ceAbstractionStarter]: At program point L479(lines 96 532) the Hoare annotation is: (let ((.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse4 (= 4528 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse7 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse3 .cse1) (and .cse3 .cse1 (= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse4 .cse3 .cse1) (and .cse5 .cse6 .cse3 .cse7 .cse1 .cse8) (and .cse9 .cse3 .cse8) (and .cse3 (= 4496 ULTIMATE.start_ssl3_connect_~s__state~0) .cse1) (and .cse0 .cse9 .cse8) (and (= 4480 ULTIMATE.start_ssl3_connect_~s__state~0) .cse3 .cse1) (and .cse4 .cse0) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse10 .cse11 .cse3 .cse7 .cse1 .cse8) (and .cse2 .cse0) (and .cse5 .cse6 .cse0) (and .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11))) [2019-11-25 08:55:43,833 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-25 08:55:43,833 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 250) no Hoare annotation was computed. [2019-11-25 08:55:43,833 INFO L444 ceAbstractionStarter]: For program point L248-2(lines 199 478) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 385) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 199 478) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 280 288) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 485) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 496) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 507) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 530) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 486) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-25 08:55:43,834 INFO L440 ceAbstractionStarter]: At program point L118(lines 114 508) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-11-25 08:55:43,834 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 529) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 352) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L516(lines 516 521) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L516-2(lines 515 529) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 484) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 495) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 506) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 231) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 199 478) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 520) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 359) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L354-2(lines 354 359) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 225) no Hoare annotation was computed. [2019-11-25 08:55:43,835 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 483) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 494) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 505) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 456) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 484) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse4 .cse3) (and .cse0 .cse1 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse3))) [2019-11-25 08:55:43,836 INFO L440 ceAbstractionStarter]: At program point L124(lines 120 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L447 ceAbstractionStarter]: At program point L554(lines 546 556) the Hoare annotation is: true [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 199 478) no Hoare annotation was computed. [2019-11-25 08:55:43,836 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 393) no Hoare annotation was computed. [2019-11-25 08:55:43,837 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 482) no Hoare annotation was computed. [2019-11-25 08:55:43,843 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 493) no Hoare annotation was computed. [2019-11-25 08:55:43,843 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 504) no Hoare annotation was computed. [2019-11-25 08:55:43,843 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 527) no Hoare annotation was computed. [2019-11-25 08:55:43,843 INFO L444 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-11-25 08:55:43,843 INFO L440 ceAbstractionStarter]: At program point L193(lines 192 482) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse4 .cse1 .cse3) (and .cse0 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-11-25 08:55:43,843 INFO L440 ceAbstractionStarter]: At program point L160(lines 150 496) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 427) no Hoare annotation was computed. [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 481) no Hoare annotation was computed. [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 492) no Hoare annotation was computed. [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 503) no Hoare annotation was computed. [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 74 544) no Hoare annotation was computed. [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-25 08:55:43,844 INFO L444 ceAbstractionStarter]: For program point L460-2(lines 460 462) no Hoare annotation was computed. [2019-11-25 08:55:43,845 INFO L444 ceAbstractionStarter]: For program point L295(lines 295 297) no Hoare annotation was computed. [2019-11-25 08:55:43,845 INFO L444 ceAbstractionStarter]: For program point L295-2(lines 199 478) no Hoare annotation was computed. [2019-11-25 08:55:43,845 INFO L447 ceAbstractionStarter]: At program point L196(lines 195 481) the Hoare annotation is: true [2019-11-25 08:55:43,845 INFO L440 ceAbstractionStarter]: At program point L130(lines 126 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-25 08:55:43,845 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-25 08:55:43,845 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-11-25 08:55:43,845 INFO L444 ceAbstractionStarter]: For program point L428-2(lines 428 432) no Hoare annotation was computed. [2019-11-25 08:55:43,845 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-25 08:55:43,846 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-25 08:55:43,846 INFO L444 ceAbstractionStarter]: For program point L329-2(lines 329 333) no Hoare annotation was computed. [2019-11-25 08:55:43,846 INFO L444 ceAbstractionStarter]: For program point L263-2(lines 199 478) no Hoare annotation was computed. [2019-11-25 08:55:43,846 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-11-25 08:55:43,846 INFO L447 ceAbstractionStarter]: At program point L198(lines 197 481) the Hoare annotation is: true [2019-11-25 08:55:43,846 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 491) no Hoare annotation was computed. [2019-11-25 08:55:43,846 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 502) no Hoare annotation was computed. [2019-11-25 08:55:43,847 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 513) no Hoare annotation was computed. [2019-11-25 08:55:43,847 INFO L440 ceAbstractionStarter]: At program point L166(lines 162 492) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-25 08:55:43,847 INFO L440 ceAbstractionStarter]: At program point L100(lines 99 513) the Hoare annotation is: (let ((.cse0 (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-25 08:55:43,847 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-25 08:55:43,847 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 367) no Hoare annotation was computed. [2019-11-25 08:55:43,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:55:43 BoogieIcfgContainer [2019-11-25 08:55:43,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:55:43,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:55:43,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:55:43,886 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:55:43,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:29" (3/4) ... [2019-11-25 08:55:43,890 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:55:43,912 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:55:43,913 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:55:44,031 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ebe1ac06-1094-48f1-b669-f145f23fdbc8/bin/uautomizer/witness.graphml [2019-11-25 08:55:44,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:55:44,032 INFO L168 Benchmark]: Toolchain (without parser) took 15367.72 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 702.0 MB). Free memory was 950.1 MB in the beginning and 904.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 748.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:44,032 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:44,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:44,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:44,033 INFO L168 Benchmark]: Boogie Preprocessor took 35.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:44,034 INFO L168 Benchmark]: RCFGBuilder took 729.17 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:44,034 INFO L168 Benchmark]: TraceAbstraction took 13944.70 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 560.5 MB). Free memory was 1.1 GB in the beginning and 925.8 MB in the end (delta: 147.7 MB). Peak memory consumption was 708.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:44,035 INFO L168 Benchmark]: Witness Printer took 145.22 ms. Allocated memory is still 1.7 GB. Free memory was 925.8 MB in the beginning and 904.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:44,036 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 456.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 729.17 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13944.70 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 560.5 MB). Free memory was 1.1 GB in the beginning and 925.8 MB in the end (delta: 147.7 MB). Peak memory consumption was 708.2 MB. Max. memory is 11.5 GB. * Witness Printer took 145.22 ms. Allocated memory is still 1.7 GB. Free memory was 925.8 MB in the beginning and 904.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((4560 <= s__state && blastFlag <= 2) && 0 == s__hit)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((4560 <= s__state && blastFlag <= 4) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 4368 == s__state) || (blastFlag <= 2 && 0 == s__hit)) || ((4512 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 0 == s__hit) && 4464 == s__state)) || ((4528 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && s__s3__tmp__new_cipher__algorithms == 256) && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 4496 == s__state) && 0 == s__hit)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || ((4480 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (4528 == s__state && blastFlag <= 2)) || (blastFlag <= 2 && 4384 == s__state)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (4512 == s__state && blastFlag <= 2)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) || (blastFlag <= 2 && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 12292 == s__state) || (((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 12292 == s__state) && 0 == s__hit) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: SAFE, OverallTime: 13.8s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 4616 SDtfs, 1482 SDslu, 2556 SDs, 0 SdLazy, 2390 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1553 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9585occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 13142 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1989 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 6398 NumberOfCodeBlocks, 6398 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6370 ConstructedInterpolants, 0 QuantifiedInterpolants, 2622380 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 21955/22034 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 correct! Received shutdown request...