./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/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 4e02aecb828ddbcb4cc0dcb3053661f316d65cc9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:12:12,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:12:12,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:12:12,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:12:12,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:12:12,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:12:12,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:12:12,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:12:12,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:12:12,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:12:12,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:12:12,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:12:12,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:12:12,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:12:12,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:12:12,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:12:12,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:12:12,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:12:12,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:12:12,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:12:12,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:12:12,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:12:12,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:12:12,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:12:12,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:12:12,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:12:12,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:12:12,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:12:12,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:12:12,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:12:12,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:12:12,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:12:12,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:12:12,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:12:12,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:12:12,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:12:12,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:12:12,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:12:12,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:12:12,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:12:12,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:12:12,531 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:12:12,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:12:12,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:12:12,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:12:12,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:12:12,574 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:12:12,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:12:12,575 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:12:12,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:12:12,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:12:12,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:12:12,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:12:12,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:12:12,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:12:12,577 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:12:12,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:12:12,577 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:12:12,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:12:12,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:12:12,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:12:12,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:12:12,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:12:12,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:12:12,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:12:12,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:12:12,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:12:12,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:12:12,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:12:12,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:12:12,582 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_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/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 -> 4e02aecb828ddbcb4cc0dcb3053661f316d65cc9 [2019-11-15 23:12:12,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:12:12,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:12:12,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:12:12,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:12:12,637 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:12:12,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-15 23:12:12,698 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/data/713719f9b/0c41069d42f648fba32f1c7c98985f33/FLAG12859e14c [2019-11-15 23:12:13,194 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:12:13,195 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-1.c [2019-11-15 23:12:13,205 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/data/713719f9b/0c41069d42f648fba32f1c7c98985f33/FLAG12859e14c [2019-11-15 23:12:13,564 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/data/713719f9b/0c41069d42f648fba32f1c7c98985f33 [2019-11-15 23:12:13,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:12:13,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:12:13,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:13,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:12:13,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:12:13,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:13" (1/1) ... [2019-11-15 23:12:13,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57231c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:13, skipping insertion in model container [2019-11-15 23:12:13,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:13" (1/1) ... [2019-11-15 23:12:13,585 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:12:13,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:12:13,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:13,970 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:12:14,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:14,104 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:12:14,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14 WrapperNode [2019-11-15 23:12:14,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:14,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:14,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:12:14,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:12:14,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:14,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:12:14,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:12:14,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:12:14,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... [2019-11-15 23:12:14,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:12:14,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:12:14,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:12:14,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:12:14,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/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-15 23:12:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:12:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:12:14,545 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:12:15,103 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 23:12:15,104 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 23:12:15,106 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:12:15,106 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:12:15,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:15 BoogieIcfgContainer [2019-11-15 23:12:15,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:12:15,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:12:15,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:12:15,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:12:15,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:12:13" (1/3) ... [2019-11-15 23:12:15,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8cb5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:15, skipping insertion in model container [2019-11-15 23:12:15,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:14" (2/3) ... [2019-11-15 23:12:15,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8cb5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:12:15, skipping insertion in model container [2019-11-15 23:12:15,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:15" (3/3) ... [2019-11-15 23:12:15,116 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2019-11-15 23:12:15,127 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:12:15,135 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:12:15,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:12:15,183 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:12:15,184 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:12:15,184 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:12:15,184 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:12:15,184 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:12:15,184 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:12:15,184 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:12:15,185 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:12:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-15 23:12:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:12:15,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:15,234 INFO L380 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-15 23:12:15,259 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-15 23:12:15,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:15,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796327893] [2019-11-15 23:12:15,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:15,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:15,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:15,514 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-15 23:12:15,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796327893] [2019-11-15 23:12:15,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:15,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:12:15,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308113738] [2019-11-15 23:12:15,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:15,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:15,545 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-15 23:12:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:15,835 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-15 23:12:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:15,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:12:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:15,854 INFO L225 Difference]: With dead ends: 251 [2019-11-15 23:12:15,854 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 23:12:15,858 INFO L600 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-15 23:12:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 23:12:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-15 23:12:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:12:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-15 23:12:15,907 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-15 23:12:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:15,908 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-15 23:12:15,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-15 23:12:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:12:15,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:15,911 INFO L380 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-15 23:12:15,911 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-15 23:12:15,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:15,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199061269] [2019-11-15 23:12:15,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:15,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:15,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:15,986 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-15 23:12:15,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199061269] [2019-11-15 23:12:15,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:15,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:15,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973807769] [2019-11-15 23:12:15,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:15,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:15,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:15,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:15,990 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-15 23:12:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:16,269 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-15 23:12:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:16,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:12:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:16,272 INFO L225 Difference]: With dead ends: 237 [2019-11-15 23:12:16,273 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 23:12:16,274 INFO L600 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-15 23:12:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 23:12:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-15 23:12:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 23:12:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-15 23:12:16,289 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-15 23:12:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:16,290 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-15 23:12:16,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-15 23:12:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:12:16,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:16,293 INFO L380 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-15 23:12:16,295 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-15 23:12:16,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:16,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854859003] [2019-11-15 23:12:16,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:16,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:16,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:16,416 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-15 23:12:16,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854859003] [2019-11-15 23:12:16,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:16,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:16,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200014929] [2019-11-15 23:12:16,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:16,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:16,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:16,426 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-15 23:12:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:16,625 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-15 23:12:16,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:16,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 23:12:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:16,628 INFO L225 Difference]: With dead ends: 270 [2019-11-15 23:12:16,628 INFO L226 Difference]: Without dead ends: 150 [2019-11-15 23:12:16,629 INFO L600 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-15 23:12:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-15 23:12:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-15 23:12:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:12:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-15 23:12:16,656 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-15 23:12:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:16,657 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-15 23:12:16,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-15 23:12:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:12:16,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:16,662 INFO L380 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-15 23:12:16,663 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2019-11-15 23:12:16,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:16,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323960220] [2019-11-15 23:12:16,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:16,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:16,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:16,802 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-15 23:12:16,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323960220] [2019-11-15 23:12:16,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:16,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:16,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371038502] [2019-11-15 23:12:16,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:16,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:16,806 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-15 23:12:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:17,038 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-15 23:12:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:17,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 23:12:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:17,041 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:12:17,041 INFO L226 Difference]: Without dead ends: 196 [2019-11-15 23:12:17,043 INFO L600 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-15 23:12:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-15 23:12:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-15 23:12:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 23:12:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-15 23:12:17,058 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-15 23:12:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:17,059 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-15 23:12:17,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-15 23:12:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:12:17,063 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:17,064 INFO L380 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-15 23:12:17,064 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2019-11-15 23:12:17,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:17,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601428739] [2019-11-15 23:12:17,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:17,155 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-15 23:12:17,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601428739] [2019-11-15 23:12:17,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:17,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:17,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380916560] [2019-11-15 23:12:17,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:17,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:17,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:17,160 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-15 23:12:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:17,323 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2019-11-15 23:12:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:17,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 23:12:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:17,326 INFO L225 Difference]: With dead ends: 390 [2019-11-15 23:12:17,326 INFO L226 Difference]: Without dead ends: 212 [2019-11-15 23:12:17,327 INFO L600 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-15 23:12:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-15 23:12:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-11-15 23:12:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 23:12:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-15 23:12:17,354 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-15 23:12:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:17,357 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-15 23:12:17,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-15 23:12:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:12:17,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:17,370 INFO L380 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, 1] [2019-11-15 23:12:17,370 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2019-11-15 23:12:17,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:17,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914261745] [2019-11-15 23:12:17,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:17,479 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-15 23:12:17,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914261745] [2019-11-15 23:12:17,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:17,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:17,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833046502] [2019-11-15 23:12:17,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:17,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:17,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:17,485 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-15 23:12:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:17,669 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-15 23:12:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:17,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 23:12:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:17,673 INFO L225 Difference]: With dead ends: 427 [2019-11-15 23:12:17,673 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 23:12:17,674 INFO L600 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-15 23:12:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 23:12:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-15 23:12:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-15 23:12:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-15 23:12:17,698 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-15 23:12:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:17,700 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-15 23:12:17,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-15 23:12:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 23:12:17,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:17,714 INFO L380 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] [2019-11-15 23:12:17,715 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2019-11-15 23:12:17,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:17,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273835159] [2019-11-15 23:12:17,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:17,829 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-15 23:12:17,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273835159] [2019-11-15 23:12:17,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:17,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:17,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850930220] [2019-11-15 23:12:17,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:17,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:17,832 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-15 23:12:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:17,881 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-15 23:12:17,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:17,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 23:12:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:17,885 INFO L225 Difference]: With dead ends: 661 [2019-11-15 23:12:17,886 INFO L226 Difference]: Without dead ends: 443 [2019-11-15 23:12:17,887 INFO L600 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-15 23:12:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-15 23:12:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-15 23:12:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-15 23:12:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-15 23:12:17,906 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-15 23:12:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:17,906 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-15 23:12:17,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-15 23:12:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 23:12:17,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:17,909 INFO L380 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, 1] [2019-11-15 23:12:17,910 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2019-11-15 23:12:17,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:17,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559479470] [2019-11-15 23:12:17,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:17,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:17,997 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-15 23:12:17,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559479470] [2019-11-15 23:12:17,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:17,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:17,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109907754] [2019-11-15 23:12:17,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:18,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:18,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:18,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:18,001 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-15 23:12:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:18,047 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-15 23:12:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:18,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 23:12:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:18,053 INFO L225 Difference]: With dead ends: 661 [2019-11-15 23:12:18,053 INFO L226 Difference]: Without dead ends: 659 [2019-11-15 23:12:18,054 INFO L600 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-15 23:12:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-15 23:12:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-15 23:12:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-15 23:12:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-15 23:12:18,074 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-15 23:12:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:18,074 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-15 23:12:18,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-15 23:12:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-15 23:12:18,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:18,077 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:18,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:18,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1653094939, now seen corresponding path program 1 times [2019-11-15 23:12:18,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:18,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107388555] [2019-11-15 23:12:18,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 23:12:18,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107388555] [2019-11-15 23:12:18,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:18,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:18,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473776675] [2019-11-15 23:12:18,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:18,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:18,141 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-15 23:12:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:18,350 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-15 23:12:18,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:18,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-15 23:12:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:18,357 INFO L225 Difference]: With dead ends: 1462 [2019-11-15 23:12:18,358 INFO L226 Difference]: Without dead ends: 809 [2019-11-15 23:12:18,359 INFO L600 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-15 23:12:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-15 23:12:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-15 23:12:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-15 23:12:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-15 23:12:18,385 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 146 [2019-11-15 23:12:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:18,385 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-15 23:12:18,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-15 23:12:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 23:12:18,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:18,389 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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-15 23:12:18,389 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:18,390 INFO L82 PathProgramCache]: Analyzing trace with hash 285230582, now seen corresponding path program 1 times [2019-11-15 23:12:18,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:18,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710227027] [2019-11-15 23:12:18,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-15 23:12:18,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710227027] [2019-11-15 23:12:18,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:18,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:18,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124987421] [2019-11-15 23:12:18,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:18,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:18,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:18,451 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-15 23:12:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:18,608 INFO L93 Difference]: Finished difference Result 1623 states and 2286 transitions. [2019-11-15 23:12:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:18,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-15 23:12:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:18,615 INFO L225 Difference]: With dead ends: 1623 [2019-11-15 23:12:18,615 INFO L226 Difference]: Without dead ends: 856 [2019-11-15 23:12:18,617 INFO L600 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-15 23:12:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-11-15 23:12:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 845. [2019-11-15 23:12:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-11-15 23:12:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1180 transitions. [2019-11-15 23:12:18,642 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1180 transitions. Word has length 182 [2019-11-15 23:12:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:18,643 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1180 transitions. [2019-11-15 23:12:18,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1180 transitions. [2019-11-15 23:12:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 23:12:18,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:18,647 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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-15 23:12:18,647 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash 742481215, now seen corresponding path program 1 times [2019-11-15 23:12:18,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:18,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397730986] [2019-11-15 23:12:18,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-15 23:12:18,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397730986] [2019-11-15 23:12:18,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:18,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:18,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318541144] [2019-11-15 23:12:18,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:18,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:18,714 INFO L87 Difference]: Start difference. First operand 845 states and 1180 transitions. Second operand 3 states. [2019-11-15 23:12:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:18,858 INFO L93 Difference]: Finished difference Result 1765 states and 2467 transitions. [2019-11-15 23:12:18,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:18,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-15 23:12:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:18,865 INFO L225 Difference]: With dead ends: 1765 [2019-11-15 23:12:18,866 INFO L226 Difference]: Without dead ends: 929 [2019-11-15 23:12:18,867 INFO L600 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-15 23:12:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-11-15 23:12:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 920. [2019-11-15 23:12:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-11-15 23:12:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1270 transitions. [2019-11-15 23:12:18,899 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1270 transitions. Word has length 203 [2019-11-15 23:12:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:18,899 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1270 transitions. [2019-11-15 23:12:18,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1270 transitions. [2019-11-15 23:12:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-15 23:12:18,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:18,905 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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, 1] [2019-11-15 23:12:18,905 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 884333740, now seen corresponding path program 1 times [2019-11-15 23:12:18,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:18,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283150251] [2019-11-15 23:12:18,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:18,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-15 23:12:19,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283150251] [2019-11-15 23:12:19,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:19,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:19,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069468298] [2019-11-15 23:12:19,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:19,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:19,025 INFO L87 Difference]: Start difference. First operand 920 states and 1270 transitions. Second operand 3 states. [2019-11-15 23:12:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:19,186 INFO L93 Difference]: Finished difference Result 1921 states and 2656 transitions. [2019-11-15 23:12:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:19,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-15 23:12:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:19,193 INFO L225 Difference]: With dead ends: 1921 [2019-11-15 23:12:19,193 INFO L226 Difference]: Without dead ends: 1010 [2019-11-15 23:12:19,195 INFO L600 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-15 23:12:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-11-15 23:12:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1004. [2019-11-15 23:12:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-11-15 23:12:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1369 transitions. [2019-11-15 23:12:19,224 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1369 transitions. Word has length 227 [2019-11-15 23:12:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:19,225 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1369 transitions. [2019-11-15 23:12:19,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1369 transitions. [2019-11-15 23:12:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-15 23:12:19,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:19,229 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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, 1] [2019-11-15 23:12:19,229 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:19,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:19,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1915374638, now seen corresponding path program 1 times [2019-11-15 23:12:19,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:19,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608530498] [2019-11-15 23:12:19,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:19,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:19,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-15 23:12:19,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608530498] [2019-11-15 23:12:19,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:19,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:19,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298137108] [2019-11-15 23:12:19,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:19,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:19,359 INFO L87 Difference]: Start difference. First operand 1004 states and 1369 transitions. Second operand 3 states. [2019-11-15 23:12:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:19,533 INFO L93 Difference]: Finished difference Result 2101 states and 2881 transitions. [2019-11-15 23:12:19,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:19,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-15 23:12:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:19,542 INFO L225 Difference]: With dead ends: 2101 [2019-11-15 23:12:19,543 INFO L226 Difference]: Without dead ends: 1106 [2019-11-15 23:12:19,545 INFO L600 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-15 23:12:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-11-15 23:12:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1097. [2019-11-15 23:12:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-11-15 23:12:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1477 transitions. [2019-11-15 23:12:19,581 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1477 transitions. Word has length 227 [2019-11-15 23:12:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:19,582 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 1477 transitions. [2019-11-15 23:12:19,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1477 transitions. [2019-11-15 23:12:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-15 23:12:19,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:19,588 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:12:19,588 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash -50346324, now seen corresponding path program 1 times [2019-11-15 23:12:19,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:19,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506152251] [2019-11-15 23:12:19,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:19,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:19,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-15 23:12:19,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506152251] [2019-11-15 23:12:19,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:19,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:19,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493467255] [2019-11-15 23:12:19,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:19,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:19,696 INFO L87 Difference]: Start difference. First operand 1097 states and 1477 transitions. Second operand 3 states. [2019-11-15 23:12:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:19,738 INFO L93 Difference]: Finished difference Result 3270 states and 4402 transitions. [2019-11-15 23:12:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:19,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-15 23:12:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:19,753 INFO L225 Difference]: With dead ends: 3270 [2019-11-15 23:12:19,753 INFO L226 Difference]: Without dead ends: 2182 [2019-11-15 23:12:19,756 INFO L600 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-15 23:12:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-11-15 23:12:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2180. [2019-11-15 23:12:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2019-11-15 23:12:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2934 transitions. [2019-11-15 23:12:19,822 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2934 transitions. Word has length 257 [2019-11-15 23:12:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:19,822 INFO L462 AbstractCegarLoop]: Abstraction has 2180 states and 2934 transitions. [2019-11-15 23:12:19,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2934 transitions. [2019-11-15 23:12:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-15 23:12:19,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:19,830 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:12:19,830 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash 980694574, now seen corresponding path program 1 times [2019-11-15 23:12:19,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:19,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024003787] [2019-11-15 23:12:19,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:19,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:19,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-15 23:12:19,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024003787] [2019-11-15 23:12:19,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:19,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:19,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453824928] [2019-11-15 23:12:19,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:19,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:19,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:19,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:19,949 INFO L87 Difference]: Start difference. First operand 2180 states and 2934 transitions. Second operand 3 states. [2019-11-15 23:12:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:20,145 INFO L93 Difference]: Finished difference Result 4576 states and 6206 transitions. [2019-11-15 23:12:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:20,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-11-15 23:12:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:20,161 INFO L225 Difference]: With dead ends: 4576 [2019-11-15 23:12:20,162 INFO L226 Difference]: Without dead ends: 2405 [2019-11-15 23:12:20,167 INFO L600 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-15 23:12:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2019-11-15 23:12:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2393. [2019-11-15 23:12:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-11-15 23:12:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3177 transitions. [2019-11-15 23:12:20,235 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3177 transitions. Word has length 257 [2019-11-15 23:12:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:20,236 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 3177 transitions. [2019-11-15 23:12:20,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3177 transitions. [2019-11-15 23:12:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 23:12:20,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:20,243 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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, 1, 1, 1] [2019-11-15 23:12:20,243 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:20,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1095007574, now seen corresponding path program 1 times [2019-11-15 23:12:20,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:20,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657719226] [2019-11-15 23:12:20,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:20,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:20,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-11-15 23:12:20,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657719226] [2019-11-15 23:12:20,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:20,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:20,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356229799] [2019-11-15 23:12:20,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:20,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:20,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:20,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:20,387 INFO L87 Difference]: Start difference. First operand 2393 states and 3177 transitions. Second operand 3 states. [2019-11-15 23:12:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:20,644 INFO L93 Difference]: Finished difference Result 4888 states and 6509 transitions. [2019-11-15 23:12:20,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:20,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-15 23:12:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:20,660 INFO L225 Difference]: With dead ends: 4888 [2019-11-15 23:12:20,660 INFO L226 Difference]: Without dead ends: 2504 [2019-11-15 23:12:20,663 INFO L600 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-15 23:12:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-11-15 23:12:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2492. [2019-11-15 23:12:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2492 states. [2019-11-15 23:12:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3291 transitions. [2019-11-15 23:12:20,750 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3291 transitions. Word has length 281 [2019-11-15 23:12:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:20,751 INFO L462 AbstractCegarLoop]: Abstraction has 2492 states and 3291 transitions. [2019-11-15 23:12:20,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3291 transitions. [2019-11-15 23:12:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-15 23:12:20,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:20,759 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:12:20,760 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1021889644, now seen corresponding path program 1 times [2019-11-15 23:12:20,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:20,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705157077] [2019-11-15 23:12:20,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:20,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:20,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-15 23:12:20,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705157077] [2019-11-15 23:12:20,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:20,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:20,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204930396] [2019-11-15 23:12:20,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:20,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:20,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:20,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:20,879 INFO L87 Difference]: Start difference. First operand 2492 states and 3291 transitions. Second operand 3 states. [2019-11-15 23:12:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:21,093 INFO L93 Difference]: Finished difference Result 5275 states and 7097 transitions. [2019-11-15 23:12:21,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:21,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-15 23:12:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:21,108 INFO L225 Difference]: With dead ends: 5275 [2019-11-15 23:12:21,108 INFO L226 Difference]: Without dead ends: 2792 [2019-11-15 23:12:21,111 INFO L600 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-15 23:12:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2019-11-15 23:12:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2732. [2019-11-15 23:12:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-11-15 23:12:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3573 transitions. [2019-11-15 23:12:21,180 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3573 transitions. Word has length 292 [2019-11-15 23:12:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:21,181 INFO L462 AbstractCegarLoop]: Abstraction has 2732 states and 3573 transitions. [2019-11-15 23:12:21,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3573 transitions. [2019-11-15 23:12:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-15 23:12:21,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:21,188 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 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, 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] [2019-11-15 23:12:21,188 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:21,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:21,189 INFO L82 PathProgramCache]: Analyzing trace with hash -229308938, now seen corresponding path program 1 times [2019-11-15 23:12:21,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:21,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346051579] [2019-11-15 23:12:21,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:21,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:21,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-15 23:12:21,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346051579] [2019-11-15 23:12:21,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:21,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:21,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361318845] [2019-11-15 23:12:21,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:21,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:21,293 INFO L87 Difference]: Start difference. First operand 2732 states and 3573 transitions. Second operand 3 states. [2019-11-15 23:12:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:21,535 INFO L93 Difference]: Finished difference Result 5539 states and 7235 transitions. [2019-11-15 23:12:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:21,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-15 23:12:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:21,553 INFO L225 Difference]: With dead ends: 5539 [2019-11-15 23:12:21,554 INFO L226 Difference]: Without dead ends: 2798 [2019-11-15 23:12:21,558 INFO L600 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-15 23:12:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-11-15 23:12:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2726. [2019-11-15 23:12:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2019-11-15 23:12:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3537 transitions. [2019-11-15 23:12:21,654 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3537 transitions. Word has length 300 [2019-11-15 23:12:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:21,655 INFO L462 AbstractCegarLoop]: Abstraction has 2726 states and 3537 transitions. [2019-11-15 23:12:21,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3537 transitions. [2019-11-15 23:12:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-15 23:12:21,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:21,665 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:12:21,665 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1736108088, now seen corresponding path program 1 times [2019-11-15 23:12:21,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:21,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841101757] [2019-11-15 23:12:21,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:21,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:21,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-15 23:12:21,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841101757] [2019-11-15 23:12:21,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822041105] [2019-11-15 23:12:21,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/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-15 23:12:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:22,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:12:22,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-15 23:12:22,196 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:22,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:12:22,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013972666] [2019-11-15 23:12:22,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:22,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:22,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:22,201 INFO L87 Difference]: Start difference. First operand 2726 states and 3537 transitions. Second operand 4 states. [2019-11-15 23:12:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:22,661 INFO L93 Difference]: Finished difference Result 8268 states and 10711 transitions. [2019-11-15 23:12:22,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:12:22,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-11-15 23:12:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:22,696 INFO L225 Difference]: With dead ends: 8268 [2019-11-15 23:12:22,696 INFO L226 Difference]: Without dead ends: 5545 [2019-11-15 23:12:22,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 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-15 23:12:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2019-11-15 23:12:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 3572. [2019-11-15 23:12:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-11-15 23:12:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4587 transitions. [2019-11-15 23:12:22,848 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4587 transitions. Word has length 331 [2019-11-15 23:12:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:22,849 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 4587 transitions. [2019-11-15 23:12:22,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4587 transitions. [2019-11-15 23:12:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-15 23:12:22,859 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:22,860 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:12:23,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:23,065 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash 619319881, now seen corresponding path program 1 times [2019-11-15 23:12:23,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:23,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858580289] [2019-11-15 23:12:23,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:23,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:23,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-11-15 23:12:23,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858580289] [2019-11-15 23:12:23,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:23,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:23,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353496898] [2019-11-15 23:12:23,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:23,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:23,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:23,303 INFO L87 Difference]: Start difference. First operand 3572 states and 4587 transitions. Second operand 3 states. [2019-11-15 23:12:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:23,427 INFO L93 Difference]: Finished difference Result 9456 states and 12199 transitions. [2019-11-15 23:12:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:23,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-15 23:12:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:23,461 INFO L225 Difference]: With dead ends: 9456 [2019-11-15 23:12:23,469 INFO L226 Difference]: Without dead ends: 5893 [2019-11-15 23:12:23,476 INFO L600 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-15 23:12:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2019-11-15 23:12:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5591. [2019-11-15 23:12:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5591 states. [2019-11-15 23:12:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5591 states to 5591 states and 7204 transitions. [2019-11-15 23:12:23,663 INFO L78 Accepts]: Start accepts. Automaton has 5591 states and 7204 transitions. Word has length 332 [2019-11-15 23:12:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:23,664 INFO L462 AbstractCegarLoop]: Abstraction has 5591 states and 7204 transitions. [2019-11-15 23:12:23,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5591 states and 7204 transitions. [2019-11-15 23:12:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-15 23:12:23,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:23,678 INFO L380 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, 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] [2019-11-15 23:12:23,679 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -319778261, now seen corresponding path program 1 times [2019-11-15 23:12:23,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:23,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038027208] [2019-11-15 23:12:23,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:23,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:23,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 23:12:23,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038027208] [2019-11-15 23:12:23,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:23,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:23,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509045627] [2019-11-15 23:12:23,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:23,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:23,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:23,950 INFO L87 Difference]: Start difference. First operand 5591 states and 7204 transitions. Second operand 3 states. [2019-11-15 23:12:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:24,262 INFO L93 Difference]: Finished difference Result 11779 states and 15109 transitions. [2019-11-15 23:12:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:24,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-11-15 23:12:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:24,276 INFO L225 Difference]: With dead ends: 11779 [2019-11-15 23:12:24,276 INFO L226 Difference]: Without dead ends: 6197 [2019-11-15 23:12:24,284 INFO L600 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-15 23:12:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-11-15 23:12:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 5765. [2019-11-15 23:12:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-11-15 23:12:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7438 transitions. [2019-11-15 23:12:24,435 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7438 transitions. Word has length 337 [2019-11-15 23:12:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:24,436 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7438 transitions. [2019-11-15 23:12:24,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7438 transitions. [2019-11-15 23:12:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-15 23:12:24,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:24,451 INFO L380 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, 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-15 23:12:24,451 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:24,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1517002467, now seen corresponding path program 1 times [2019-11-15 23:12:24,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:24,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806270138] [2019-11-15 23:12:24,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:24,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:24,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 23:12:24,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806270138] [2019-11-15 23:12:24,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835321358] [2019-11-15 23:12:24,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/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-15 23:12:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:24,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:12:24,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-15 23:12:24,989 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:24,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:12:24,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543058988] [2019-11-15 23:12:24,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:24,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:24,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:24,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:24,993 INFO L87 Difference]: Start difference. First operand 5765 states and 7438 transitions. Second operand 4 states. [2019-11-15 23:12:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:25,510 INFO L93 Difference]: Finished difference Result 13053 states and 16776 transitions. [2019-11-15 23:12:25,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:12:25,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-11-15 23:12:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:25,527 INFO L225 Difference]: With dead ends: 13053 [2019-11-15 23:12:25,527 INFO L226 Difference]: Without dead ends: 7284 [2019-11-15 23:12:25,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 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-15 23:12:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7284 states. [2019-11-15 23:12:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7284 to 5912. [2019-11-15 23:12:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-11-15 23:12:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 7555 transitions. [2019-11-15 23:12:25,734 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 7555 transitions. Word has length 375 [2019-11-15 23:12:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:25,735 INFO L462 AbstractCegarLoop]: Abstraction has 5912 states and 7555 transitions. [2019-11-15 23:12:25,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 7555 transitions. [2019-11-15 23:12:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-11-15 23:12:25,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:25,753 INFO L380 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, 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-15 23:12:25,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:25,958 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:25,959 INFO L82 PathProgramCache]: Analyzing trace with hash 934852515, now seen corresponding path program 1 times [2019-11-15 23:12:25,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:25,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830394499] [2019-11-15 23:12:25,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:25,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:25,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-15 23:12:26,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830394499] [2019-11-15 23:12:26,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:26,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:26,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493530153] [2019-11-15 23:12:26,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:12:26,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:26,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:26,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:26,198 INFO L87 Difference]: Start difference. First operand 5912 states and 7555 transitions. Second operand 3 states. [2019-11-15 23:12:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:26,444 INFO L93 Difference]: Finished difference Result 11428 states and 14363 transitions. [2019-11-15 23:12:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:26,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2019-11-15 23:12:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:26,452 INFO L225 Difference]: With dead ends: 11428 [2019-11-15 23:12:26,453 INFO L226 Difference]: Without dead ends: 3254 [2019-11-15 23:12:26,462 INFO L600 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-15 23:12:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-11-15 23:12:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3162. [2019-11-15 23:12:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2019-11-15 23:12:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 3995 transitions. [2019-11-15 23:12:26,555 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 3995 transitions. Word has length 414 [2019-11-15 23:12:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:26,556 INFO L462 AbstractCegarLoop]: Abstraction has 3162 states and 3995 transitions. [2019-11-15 23:12:26,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:12:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 3995 transitions. [2019-11-15 23:12:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-11-15 23:12:26,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:12:26,571 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 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, 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-15 23:12:26,571 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:12:26,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:26,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1275695783, now seen corresponding path program 1 times [2019-11-15 23:12:26,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:26,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957462318] [2019-11-15 23:12:26,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:26,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:26,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-15 23:12:26,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957462318] [2019-11-15 23:12:26,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526921872] [2019-11-15 23:12:26,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/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-15 23:12:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:27,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:12:27,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2019-11-15 23:12:27,435 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:27,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:12:27,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210744996] [2019-11-15 23:12:27,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:12:27,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:27,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:12:27,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:12:27,439 INFO L87 Difference]: Start difference. First operand 3162 states and 3995 transitions. Second operand 4 states. [2019-11-15 23:12:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:27,688 INFO L93 Difference]: Finished difference Result 3822 states and 4839 transitions. [2019-11-15 23:12:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:12:27,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 481 [2019-11-15 23:12:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:12:27,689 INFO L225 Difference]: With dead ends: 3822 [2019-11-15 23:12:27,689 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:12:27,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 483 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-15 23:12:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:12:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:12:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:12:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:12:27,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 481 [2019-11-15 23:12:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:12:27,695 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:12:27,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:12:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:12:27,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:12:27,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:27,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:12:28,409 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 84 [2019-11-15 23:12:29,549 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-11-15 23:12:29,672 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2019-11-15 23:12:29,701 INFO L439 ceAbstractionStarter]: At program point L168(lines 164 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-15 23:12:29,702 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point L434-2(lines 434 438) no Hoare annotation was computed. [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point L335-2(lines 335 339) no Hoare annotation was computed. [2019-11-15 23:12:29,702 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 496) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 507) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 518) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 306) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 241) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 201 484) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L271-2(lines 271 275) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-15 23:12:29,703 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-15 23:12:29,704 INFO L439 ceAbstractionStarter]: At program point L206(lines 104 518) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-15 23:12:29,704 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 495) no Hoare annotation was computed. [2019-11-15 23:12:29,704 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 506) no Hoare annotation was computed. [2019-11-15 23:12:29,704 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 517) no Hoare annotation was computed. [2019-11-15 23:12:29,704 INFO L439 ceAbstractionStarter]: At program point L174(lines 170 496) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-15 23:12:29,704 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-11-15 23:12:29,704 INFO L443 ceAbstractionStarter]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2019-11-15 23:12:29,704 INFO L446 ceAbstractionStarter]: At program point L539(lines 97 540) the Hoare annotation is: true [2019-11-15 23:12:29,704 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 494) no Hoare annotation was computed. [2019-11-15 23:12:29,705 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 505) no Hoare annotation was computed. [2019-11-15 23:12:29,705 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 516) no Hoare annotation was computed. [2019-11-15 23:12:29,705 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-15 23:12:29,705 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 213) no Hoare annotation was computed. [2019-11-15 23:12:29,705 INFO L443 ceAbstractionStarter]: For program point L211-2(lines 211 213) no Hoare annotation was computed. [2019-11-15 23:12:29,709 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 493) no Hoare annotation was computed. [2019-11-15 23:12:29,709 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 504) no Hoare annotation was computed. [2019-11-15 23:12:29,709 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 515) no Hoare annotation was computed. [2019-11-15 23:12:29,709 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 479) no Hoare annotation was computed. [2019-11-15 23:12:29,710 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 455) no Hoare annotation was computed. [2019-11-15 23:12:29,711 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 425) no Hoare annotation was computed. [2019-11-15 23:12:29,711 INFO L443 ceAbstractionStarter]: For program point L411-1(lines 411 425) no Hoare annotation was computed. [2019-11-15 23:12:29,711 INFO L443 ceAbstractionStarter]: For program point L444-2(lines 444 455) no Hoare annotation was computed. [2019-11-15 23:12:29,712 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 315) no Hoare annotation was computed. [2019-11-15 23:12:29,713 INFO L439 ceAbstractionStarter]: At program point L180(lines 176 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-15 23:12:29,713 INFO L443 ceAbstractionStarter]: For program point L544(lines 544 546) no Hoare annotation was computed. [2019-11-15 23:12:29,713 INFO L443 ceAbstractionStarter]: For program point L544-2(lines 544 546) no Hoare annotation was computed. [2019-11-15 23:12:29,713 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-15 23:12:29,713 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 492) no Hoare annotation was computed. [2019-11-15 23:12:29,713 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 503) no Hoare annotation was computed. [2019-11-15 23:12:29,714 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 514) no Hoare annotation was computed. [2019-11-15 23:12:29,714 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2019-11-15 23:12:29,714 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 296) no Hoare annotation was computed. [2019-11-15 23:12:29,714 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 219) no Hoare annotation was computed. [2019-11-15 23:12:29,714 INFO L443 ceAbstractionStarter]: For program point L282-2(lines 282 296) no Hoare annotation was computed. [2019-11-15 23:12:29,714 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-11-15 23:12:29,715 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2019-11-15 23:12:29,715 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 421) no Hoare annotation was computed. [2019-11-15 23:12:29,715 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 252) no Hoare annotation was computed. [2019-11-15 23:12:29,715 INFO L443 ceAbstractionStarter]: For program point L250-2(lines 201 484) no Hoare annotation was computed. [2019-11-15 23:12:29,715 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 452) no Hoare annotation was computed. [2019-11-15 23:12:29,715 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:12:29,716 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 491) no Hoare annotation was computed. [2019-11-15 23:12:29,716 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 502) no Hoare annotation was computed. [2019-11-15 23:12:29,716 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 513) no Hoare annotation was computed. [2019-11-15 23:12:29,716 INFO L446 ceAbstractionStarter]: At program point L549(lines 10 551) the Hoare annotation is: true [2019-11-15 23:12:29,716 INFO L439 ceAbstractionStarter]: At program point L186(lines 182 492) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-11-15 23:12:29,717 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 514) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 23:12:29,717 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-15 23:12:29,717 INFO L443 ceAbstractionStarter]: For program point L87-2(lines 84 90) no Hoare annotation was computed. [2019-11-15 23:12:29,717 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-15 23:12:29,718 INFO L439 ceAbstractionStarter]: At program point L485(lines 98 538) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse4 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse6 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse1 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse6 .cse4) (and .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse11 .cse6) (and .cse1 .cse6 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse11 .cse7) (and .cse1 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse8 .cse6) (and .cse9 .cse10 .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse1))) [2019-11-15 23:12:29,718 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-11-15 23:12:29,718 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 490) no Hoare annotation was computed. [2019-11-15 23:12:29,718 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 501) no Hoare annotation was computed. [2019-11-15 23:12:29,718 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 512) no Hoare annotation was computed. [2019-11-15 23:12:29,719 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-11-15 23:12:29,719 INFO L439 ceAbstractionStarter]: At program point L321(lines 75 550) the Hoare annotation is: false [2019-11-15 23:12:29,719 INFO L443 ceAbstractionStarter]: For program point L387-2(lines 201 484) no Hoare annotation was computed. [2019-11-15 23:12:29,719 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 233) no Hoare annotation was computed. [2019-11-15 23:12:29,719 INFO L443 ceAbstractionStarter]: For program point L222-2(lines 201 484) no Hoare annotation was computed. [2019-11-15 23:12:29,719 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 536) no Hoare annotation was computed. [2019-11-15 23:12:29,720 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 291) no Hoare annotation was computed. [2019-11-15 23:12:29,720 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:12:29,720 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 284 296) no Hoare annotation was computed. [2019-11-15 23:12:29,721 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 535) no Hoare annotation was computed. [2019-11-15 23:12:29,722 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-15 23:12:29,722 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-15 23:12:29,722 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 227) no Hoare annotation was computed. [2019-11-15 23:12:29,722 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 489) no Hoare annotation was computed. [2019-11-15 23:12:29,723 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 500) no Hoare annotation was computed. [2019-11-15 23:12:29,723 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 511) no Hoare annotation was computed. [2019-11-15 23:12:29,723 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 96) no Hoare annotation was computed. [2019-11-15 23:12:29,723 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-15 23:12:29,723 INFO L443 ceAbstractionStarter]: For program point L522-2(lines 521 535) no Hoare annotation was computed. [2019-11-15 23:12:29,724 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-15 23:12:29,724 INFO L439 ceAbstractionStarter]: At program point L192(lines 188 490) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-15 23:12:29,724 INFO L439 ceAbstractionStarter]: At program point L126(lines 122 512) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-15 23:12:29,724 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 95) no Hoare annotation was computed. [2019-11-15 23:12:29,724 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:12:29,725 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 526) no Hoare annotation was computed. [2019-11-15 23:12:29,725 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 488) no Hoare annotation was computed. [2019-11-15 23:12:29,725 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 499) no Hoare annotation was computed. [2019-11-15 23:12:29,725 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 510) no Hoare annotation was computed. [2019-11-15 23:12:29,725 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 365) no Hoare annotation was computed. [2019-11-15 23:12:29,725 INFO L443 ceAbstractionStarter]: For program point L360-2(lines 360 365) no Hoare annotation was computed. [2019-11-15 23:12:29,726 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-11-15 23:12:29,726 INFO L439 ceAbstractionStarter]: At program point L195(lines 194 488) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-15 23:12:29,726 INFO L439 ceAbstractionStarter]: At program point L162(lines 152 502) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-15 23:12:29,727 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 460 462) no Hoare annotation was computed. [2019-11-15 23:12:29,728 INFO L446 ceAbstractionStarter]: At program point L560(lines 552 562) the Hoare annotation is: true [2019-11-15 23:12:29,728 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 487) no Hoare annotation was computed. [2019-11-15 23:12:29,728 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 498) no Hoare annotation was computed. [2019-11-15 23:12:29,728 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 509) no Hoare annotation was computed. [2019-11-15 23:12:29,728 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 75 550) no Hoare annotation was computed. [2019-11-15 23:12:29,729 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 399) no Hoare annotation was computed. [2019-11-15 23:12:29,729 INFO L446 ceAbstractionStarter]: At program point L198(lines 197 487) the Hoare annotation is: true [2019-11-15 23:12:29,729 INFO L439 ceAbstractionStarter]: At program point L132(lines 128 510) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-15 23:12:29,729 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:12:29,729 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-15 23:12:29,729 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 267) no Hoare annotation was computed. [2019-11-15 23:12:29,730 INFO L443 ceAbstractionStarter]: For program point L265-2(lines 201 484) no Hoare annotation was computed. [2019-11-15 23:12:29,730 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-15 23:12:29,730 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 334) no Hoare annotation was computed. [2019-11-15 23:12:29,730 INFO L446 ceAbstractionStarter]: At program point L200(lines 199 487) the Hoare annotation is: true [2019-11-15 23:12:29,730 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 497) no Hoare annotation was computed. [2019-11-15 23:12:29,730 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 508) no Hoare annotation was computed. [2019-11-15 23:12:29,731 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 519) no Hoare annotation was computed. [2019-11-15 23:12:29,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:12:29 BoogieIcfgContainer [2019-11-15 23:12:29,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:12:29,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:12:29,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:12:29,778 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:12:29,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:15" (3/4) ... [2019-11-15 23:12:29,782 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:12:29,813 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:12:29,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:12:29,989 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3e993c0b-a2dd-4ca9-8a76-c5d46602211d/bin/uautomizer/witness.graphml [2019-11-15 23:12:29,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:12:29,991 INFO L168 Benchmark]: Toolchain (without parser) took 16424.06 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 718.3 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -273.3 MB). Peak memory consumption was 445.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:29,992 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:29,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:29,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:29,993 INFO L168 Benchmark]: Boogie Preprocessor took 80.12 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-15 23:12:29,993 INFO L168 Benchmark]: RCFGBuilder took 853.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:29,994 INFO L168 Benchmark]: TraceAbstraction took 14668.01 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 592.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -191.9 MB). Peak memory consumption was 400.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:29,994 INFO L168 Benchmark]: Witness Printer took 212.94 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:29,996 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 536.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 853.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14668.01 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 592.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -191.9 MB). Peak memory consumption was 400.5 MB. Max. memory is 11.5 GB. * Witness Printer took 212.94 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: 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: 182]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((s__state <= 4560 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && 0 == s__hit) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 4) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && 0 == s__hit) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4368 == s__state)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (s__state == 4384 && blastFlag <= 2) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && 0 == s__hit) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 14.5s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, HoareTripleCheckerStatistics: 4515 SDtfs, 1551 SDslu, 2498 SDs, 0 SdLazy, 2467 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5912occurred 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.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 4422 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 177 NumberOfFragments, 437 HoareAnnotationTreeSize, 22 FomulaSimplifications, 9443 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1460 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 6366 NumberOfCodeBlocks, 6366 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2477651 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2052 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 23271/23337 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...