./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.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/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/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 8346756894adf6929573c07aee1f1cc947e301ed ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:59,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:59,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:59,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:59,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:59,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:59,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:59,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:59,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:59,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:59,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:59,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:59,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:59,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:59,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:59,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:59,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:59,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:59,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:59,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:59,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:59,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:59,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:59,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:59,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:59,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:59,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:59,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:59,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:59,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:59,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:59,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:59,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:59,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:59,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:59,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:59,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:59,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:59,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:59,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:59,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:59,094 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:59,111 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:59,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:59,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:59,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:59,112 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:59,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:59,113 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:59,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:59,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:59,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:59,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:59,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:59,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:59,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:59,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:59,123 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:59,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:59,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:59,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:59,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:59,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:59,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:59,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:59,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:59,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:59,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:59,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:59,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:59,125 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/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/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 -> 8346756894adf6929573c07aee1f1cc947e301ed [2019-10-22 09:01:59,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:59,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:59,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:59,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:59,184 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:59,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-10-22 09:01:59,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/data/f5c4caac0/af8be315c58641ccbfde0d71431608d8/FLAGa917a4539 [2019-10-22 09:01:59,715 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:59,716 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-10-22 09:01:59,730 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/data/f5c4caac0/af8be315c58641ccbfde0d71431608d8/FLAGa917a4539 [2019-10-22 09:02:00,037 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/data/f5c4caac0/af8be315c58641ccbfde0d71431608d8 [2019-10-22 09:02:00,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:00,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:00,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:00,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:00,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:00,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41de5395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00, skipping insertion in model container [2019-10-22 09:02:00,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,058 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:00,109 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:00,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:00,399 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:00,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:00,473 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:00,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00 WrapperNode [2019-10-22 09:02:00,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:00,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:00,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:00,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:00,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:00,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:00,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:00,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:00,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... [2019-10-22 09:02:00,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:00,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:00,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:00,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:00,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/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-10-22 09:02:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:00,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:00,834 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:02:01,421 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 09:02:01,421 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 09:02:01,422 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:01,423 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:01,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:01 BoogieIcfgContainer [2019-10-22 09:02:01,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:01,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:01,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:01,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:01,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:00" (1/3) ... [2019-10-22 09:02:01,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184ff3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:01, skipping insertion in model container [2019-10-22 09:02:01,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:00" (2/3) ... [2019-10-22 09:02:01,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184ff3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:01, skipping insertion in model container [2019-10-22 09:02:01,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:01" (3/3) ... [2019-10-22 09:02:01,431 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-10-22 09:02:01,437 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:01,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:02:01,449 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:02:01,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:01,467 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:01,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:01,468 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:01,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:01,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:01,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:01,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-22 09:02:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:02:01,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:01,491 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, 1, 1] [2019-10-22 09:02:01,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:01,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-10-22 09:02:01,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:01,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076029] [2019-10-22 09:02:01,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:01,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:01,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:01,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076029] [2019-10-22 09:02:01,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:01,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:01,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43277493] [2019-10-22 09:02:01,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:01,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:01,706 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-10-22 09:02:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:01,922 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-10-22 09:02:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:01,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:02:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:01,941 INFO L225 Difference]: With dead ends: 324 [2019-10-22 09:02:01,941 INFO L226 Difference]: Without dead ends: 159 [2019-10-22 09:02:01,944 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-10-22 09:02:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-22 09:02:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-22 09:02:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-22 09:02:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-10-22 09:02:01,991 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-10-22 09:02:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:01,992 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-10-22 09:02:01,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-10-22 09:02:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:02:01,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:01,993 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, 1, 1, 1] [2019-10-22 09:02:01,993 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:01,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-10-22 09:02:01,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:01,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430896439] [2019-10-22 09:02:01,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:01,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:01,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:02,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430896439] [2019-10-22 09:02:02,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:02,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:02,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369475253] [2019-10-22 09:02:02,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:02,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:02,048 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-10-22 09:02:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:02,188 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-10-22 09:02:02,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:02,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:02:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:02,190 INFO L225 Difference]: With dead ends: 329 [2019-10-22 09:02:02,190 INFO L226 Difference]: Without dead ends: 179 [2019-10-22 09:02:02,191 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-10-22 09:02:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-22 09:02:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-10-22 09:02:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-22 09:02:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-10-22 09:02:02,205 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-10-22 09:02:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:02,205 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-10-22 09:02:02,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-10-22 09:02:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:02:02,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:02,206 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, 1, 1, 1] [2019-10-22 09:02:02,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:02,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-10-22 09:02:02,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:02,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710426876] [2019-10-22 09:02:02,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:02,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710426876] [2019-10-22 09:02:02,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:02,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:02,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618770782] [2019-10-22 09:02:02,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:02,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:02,245 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-10-22 09:02:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:02,369 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-10-22 09:02:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:02,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:02:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:02,371 INFO L225 Difference]: With dead ends: 359 [2019-10-22 09:02:02,371 INFO L226 Difference]: Without dead ends: 187 [2019-10-22 09:02:02,372 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-10-22 09:02:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-22 09:02:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-10-22 09:02:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-22 09:02:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-10-22 09:02:02,385 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-10-22 09:02:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:02,385 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-10-22 09:02:02,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-10-22 09:02:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:02:02,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:02,393 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, 1, 1, 1] [2019-10-22 09:02:02,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-10-22 09:02:02,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:02,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743693144] [2019-10-22 09:02:02,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:02,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743693144] [2019-10-22 09:02:02,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:02,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:02,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877766320] [2019-10-22 09:02:02,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:02,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:02,458 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-10-22 09:02:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:02,601 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-10-22 09:02:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:02,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:02:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:02,603 INFO L225 Difference]: With dead ends: 364 [2019-10-22 09:02:02,603 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 09:02:02,604 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-10-22 09:02:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 09:02:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-10-22 09:02:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 09:02:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-10-22 09:02:02,625 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-10-22 09:02:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:02,626 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-10-22 09:02:02,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-10-22 09:02:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:02:02,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:02,627 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, 1, 1, 1, 1] [2019-10-22 09:02:02,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-10-22 09:02:02,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:02,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107752995] [2019-10-22 09:02:02,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:02,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107752995] [2019-10-22 09:02:02,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:02,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:02,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885646643] [2019-10-22 09:02:02,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:02,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:02,691 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-10-22 09:02:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:02,810 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-10-22 09:02:02,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:02,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 09:02:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:02,813 INFO L225 Difference]: With dead ends: 375 [2019-10-22 09:02:02,813 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 09:02:02,814 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-10-22 09:02:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 09:02:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-10-22 09:02:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 09:02:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-10-22 09:02:02,830 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-10-22 09:02:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:02,830 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-10-22 09:02:02,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-10-22 09:02:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:02,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:02,831 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, 1, 1, 1, 1, 1] [2019-10-22 09:02:02,832 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-10-22 09:02:02,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:02,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236031223] [2019-10-22 09:02:02,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:02,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:02,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236031223] [2019-10-22 09:02:02,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:02,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:02,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826427249] [2019-10-22 09:02:02,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:02,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:02,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:02,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:02,890 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-10-22 09:02:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:03,012 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-10-22 09:02:03,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:03,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:02:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:03,014 INFO L225 Difference]: With dead ends: 375 [2019-10-22 09:02:03,014 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 09:02:03,014 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-10-22 09:02:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 09:02:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-10-22 09:02:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 09:02:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-10-22 09:02:03,022 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-10-22 09:02:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:03,022 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-10-22 09:02:03,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-10-22 09:02:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:03,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:03,023 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, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:03,024 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-10-22 09:02:03,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:03,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456822913] [2019-10-22 09:02:03,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:03,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456822913] [2019-10-22 09:02:03,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:03,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:03,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636746931] [2019-10-22 09:02:03,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:03,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:03,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:03,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:03,048 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-10-22 09:02:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:03,161 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-10-22 09:02:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:03,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 09:02:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:03,163 INFO L225 Difference]: With dead ends: 375 [2019-10-22 09:02:03,164 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 09:02:03,164 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-10-22 09:02:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 09:02:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-10-22 09:02:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 09:02:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-10-22 09:02:03,172 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-10-22 09:02:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:03,173 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-10-22 09:02:03,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-10-22 09:02:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:03,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:03,174 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, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:03,174 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-10-22 09:02:03,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:03,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675840185] [2019-10-22 09:02:03,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:03,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675840185] [2019-10-22 09:02:03,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:03,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:03,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553138964] [2019-10-22 09:02:03,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:03,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:03,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:03,226 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-10-22 09:02:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:03,468 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-10-22 09:02:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:03,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-22 09:02:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:03,471 INFO L225 Difference]: With dead ends: 571 [2019-10-22 09:02:03,471 INFO L226 Difference]: Without dead ends: 392 [2019-10-22 09:02:03,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-22 09:02:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-22 09:02:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-10-22 09:02:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 09:02:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-10-22 09:02:03,490 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-10-22 09:02:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:03,490 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-10-22 09:02:03,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-10-22 09:02:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 09:02:03,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:03,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:03,492 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:03,493 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-10-22 09:02:03,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:03,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920818630] [2019-10-22 09:02:03,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:03,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920818630] [2019-10-22 09:02:03,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:03,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:03,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074886328] [2019-10-22 09:02:03,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:03,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:03,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:03,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:03,528 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-10-22 09:02:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:03,654 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-10-22 09:02:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:03,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 09:02:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:03,656 INFO L225 Difference]: With dead ends: 780 [2019-10-22 09:02:03,656 INFO L226 Difference]: Without dead ends: 431 [2019-10-22 09:02:03,657 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-10-22 09:02:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-22 09:02:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-10-22 09:02:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-22 09:02:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-10-22 09:02:03,675 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-10-22 09:02:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:03,676 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-10-22 09:02:03,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-10-22 09:02:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 09:02:03,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:03,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:03,680 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-10-22 09:02:03,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:03,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343696627] [2019-10-22 09:02:03,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:03,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343696627] [2019-10-22 09:02:03,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:03,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:03,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855835471] [2019-10-22 09:02:03,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:03,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:03,711 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-10-22 09:02:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:03,846 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-10-22 09:02:03,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:03,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 09:02:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:03,849 INFO L225 Difference]: With dead ends: 857 [2019-10-22 09:02:03,849 INFO L226 Difference]: Without dead ends: 453 [2019-10-22 09:02:03,849 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-10-22 09:02:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-22 09:02:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-10-22 09:02:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-22 09:02:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-10-22 09:02:03,868 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-10-22 09:02:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:03,869 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-10-22 09:02:03,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-10-22 09:02:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 09:02:03,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:03,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:03,871 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-10-22 09:02:03,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:03,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375360314] [2019-10-22 09:02:03,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:03,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:03,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375360314] [2019-10-22 09:02:03,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:03,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:03,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434433809] [2019-10-22 09:02:03,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:03,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:03,903 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-10-22 09:02:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:04,044 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-10-22 09:02:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:04,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 09:02:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:04,047 INFO L225 Difference]: With dead ends: 924 [2019-10-22 09:02:04,047 INFO L226 Difference]: Without dead ends: 498 [2019-10-22 09:02:04,048 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-10-22 09:02:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-22 09:02:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-10-22 09:02:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-22 09:02:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-10-22 09:02:04,066 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-10-22 09:02:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:04,067 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-10-22 09:02:04,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-10-22 09:02:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-22 09:02:04,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:04,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:04,068 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-10-22 09:02:04,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:04,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950597572] [2019-10-22 09:02:04,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:04,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950597572] [2019-10-22 09:02:04,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:04,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:04,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569124199] [2019-10-22 09:02:04,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:04,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:04,106 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-10-22 09:02:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:04,254 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-10-22 09:02:04,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:04,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-22 09:02:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:04,256 INFO L225 Difference]: With dead ends: 991 [2019-10-22 09:02:04,256 INFO L226 Difference]: Without dead ends: 510 [2019-10-22 09:02:04,257 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-10-22 09:02:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-22 09:02:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-10-22 09:02:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-22 09:02:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-10-22 09:02:04,274 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-10-22 09:02:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:04,274 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-10-22 09:02:04,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-10-22 09:02:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 09:02:04,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:04,276 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:04,276 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-10-22 09:02:04,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:04,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66490136] [2019-10-22 09:02:04,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:04,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66490136] [2019-10-22 09:02:04,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:04,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:04,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731641762] [2019-10-22 09:02:04,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:04,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:04,315 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-10-22 09:02:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:04,428 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-10-22 09:02:04,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:04,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-22 09:02:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:04,432 INFO L225 Difference]: With dead ends: 1007 [2019-10-22 09:02:04,432 INFO L226 Difference]: Without dead ends: 514 [2019-10-22 09:02:04,433 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-10-22 09:02:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-22 09:02:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-10-22 09:02:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-22 09:02:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-10-22 09:02:04,449 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-10-22 09:02:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:04,449 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-10-22 09:02:04,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-10-22 09:02:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:02:04,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:04,450 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 09:02:04,450 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-10-22 09:02:04,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:04,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930414538] [2019-10-22 09:02:04,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:02:04,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930414538] [2019-10-22 09:02:04,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:04,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:04,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946470418] [2019-10-22 09:02:04,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:04,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:04,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:04,483 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-10-22 09:02:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:04,596 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-10-22 09:02:04,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:04,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 09:02:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:04,598 INFO L225 Difference]: With dead ends: 1035 [2019-10-22 09:02:04,599 INFO L226 Difference]: Without dead ends: 542 [2019-10-22 09:02:04,600 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-10-22 09:02:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-22 09:02:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-10-22 09:02:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-22 09:02:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-10-22 09:02:04,621 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-10-22 09:02:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:04,621 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-10-22 09:02:04,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-10-22 09:02:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:02:04,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:04,623 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:04,623 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-10-22 09:02:04,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:04,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589879577] [2019-10-22 09:02:04,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:04,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589879577] [2019-10-22 09:02:04,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:04,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:04,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514793529] [2019-10-22 09:02:04,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:04,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:04,664 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-10-22 09:02:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:04,801 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-10-22 09:02:04,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:04,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-22 09:02:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:04,804 INFO L225 Difference]: With dead ends: 1095 [2019-10-22 09:02:04,804 INFO L226 Difference]: Without dead ends: 570 [2019-10-22 09:02:04,805 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-10-22 09:02:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-22 09:02:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-10-22 09:02:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-10-22 09:02:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-10-22 09:02:04,830 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-10-22 09:02:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:04,830 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-10-22 09:02:04,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-10-22 09:02:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 09:02:04,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:04,832 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:04,832 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-10-22 09:02:04,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:04,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741973171] [2019-10-22 09:02:04,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:04,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:02:04,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741973171] [2019-10-22 09:02:04,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:04,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:04,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337986630] [2019-10-22 09:02:04,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:04,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:04,883 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-10-22 09:02:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:05,013 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-10-22 09:02:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:05,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-22 09:02:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:05,015 INFO L225 Difference]: With dead ends: 1143 [2019-10-22 09:02:05,015 INFO L226 Difference]: Without dead ends: 580 [2019-10-22 09:02:05,016 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-10-22 09:02:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-22 09:02:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-10-22 09:02:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-10-22 09:02:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-10-22 09:02:05,035 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-10-22 09:02:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:05,035 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-10-22 09:02:05,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-10-22 09:02:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-22 09:02:05,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:05,036 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:05,036 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-10-22 09:02:05,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:05,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231551508] [2019-10-22 09:02:05,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:05,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231551508] [2019-10-22 09:02:05,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:05,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:05,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146053594] [2019-10-22 09:02:05,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:05,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:05,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:05,062 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-10-22 09:02:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:05,201 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-10-22 09:02:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:05,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-22 09:02:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:05,203 INFO L225 Difference]: With dead ends: 1180 [2019-10-22 09:02:05,203 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 09:02:05,204 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-10-22 09:02:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 09:02:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-10-22 09:02:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-22 09:02:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-10-22 09:02:05,225 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-10-22 09:02:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:05,225 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-10-22 09:02:05,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-10-22 09:02:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-22 09:02:05,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:05,226 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:05,226 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-10-22 09:02:05,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:05,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580805695] [2019-10-22 09:02:05,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:05,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580805695] [2019-10-22 09:02:05,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:05,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:05,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785294790] [2019-10-22 09:02:05,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:05,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:05,252 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-10-22 09:02:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:05,390 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-10-22 09:02:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:05,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-22 09:02:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:05,392 INFO L225 Difference]: With dead ends: 1223 [2019-10-22 09:02:05,392 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 09:02:05,393 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-10-22 09:02:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 09:02:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-10-22 09:02:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-22 09:02:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-10-22 09:02:05,414 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-10-22 09:02:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:05,415 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-10-22 09:02:05,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-10-22 09:02:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 09:02:05,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:05,416 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:05,416 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-10-22 09:02:05,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:05,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111407732] [2019-10-22 09:02:05,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-22 09:02:05,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111407732] [2019-10-22 09:02:05,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:05,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:05,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572014929] [2019-10-22 09:02:05,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:05,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:05,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:05,443 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-10-22 09:02:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:05,569 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-10-22 09:02:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:05,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 09:02:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:05,571 INFO L225 Difference]: With dead ends: 1255 [2019-10-22 09:02:05,571 INFO L226 Difference]: Without dead ends: 649 [2019-10-22 09:02:05,572 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-10-22 09:02:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-22 09:02:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-10-22 09:02:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-22 09:02:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-10-22 09:02:05,596 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-10-22 09:02:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:05,596 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-10-22 09:02:05,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-10-22 09:02:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:02:05,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:05,597 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:05,598 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-10-22 09:02:05,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:05,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955387625] [2019-10-22 09:02:05,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-22 09:02:05,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955387625] [2019-10-22 09:02:05,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:05,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:05,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811857912] [2019-10-22 09:02:05,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:05,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:05,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:05,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:05,629 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-10-22 09:02:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:05,748 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-10-22 09:02:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:05,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:02:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:05,751 INFO L225 Difference]: With dead ends: 1283 [2019-10-22 09:02:05,751 INFO L226 Difference]: Without dead ends: 649 [2019-10-22 09:02:05,752 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-10-22 09:02:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-22 09:02:05,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-10-22 09:02:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-22 09:02:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-10-22 09:02:05,777 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-10-22 09:02:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:05,777 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-10-22 09:02:05,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-10-22 09:02:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-22 09:02:05,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:05,778 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:05,779 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-10-22 09:02:05,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:05,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438541707] [2019-10-22 09:02:05,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-22 09:02:05,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438541707] [2019-10-22 09:02:05,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:05,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:05,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848780211] [2019-10-22 09:02:05,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:05,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:05,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:05,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:05,810 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-10-22 09:02:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:05,946 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-10-22 09:02:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:05,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-22 09:02:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:05,949 INFO L225 Difference]: With dead ends: 1315 [2019-10-22 09:02:05,949 INFO L226 Difference]: Without dead ends: 681 [2019-10-22 09:02:05,950 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-10-22 09:02:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-10-22 09:02:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-10-22 09:02:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-10-22 09:02:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-10-22 09:02:05,979 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-10-22 09:02:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:05,979 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-10-22 09:02:05,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-10-22 09:02:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-22 09:02:05,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:05,982 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:05,983 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-10-22 09:02:05,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:05,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045223658] [2019-10-22 09:02:05,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:05,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-22 09:02:06,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045223658] [2019-10-22 09:02:06,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:06,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:06,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520754870] [2019-10-22 09:02:06,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:06,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:06,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:06,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:06,012 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-10-22 09:02:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:06,146 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-10-22 09:02:06,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:06,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-22 09:02:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:06,150 INFO L225 Difference]: With dead ends: 1351 [2019-10-22 09:02:06,151 INFO L226 Difference]: Without dead ends: 681 [2019-10-22 09:02:06,152 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-10-22 09:02:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-10-22 09:02:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-10-22 09:02:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-10-22 09:02:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-10-22 09:02:06,182 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-10-22 09:02:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:06,183 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-10-22 09:02:06,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-10-22 09:02:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:02:06,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:06,184 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-10-22 09:02:06,185 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-10-22 09:02:06,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:06,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938243877] [2019-10-22 09:02:06,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-22 09:02:06,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938243877] [2019-10-22 09:02:06,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:06,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:06,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081833242] [2019-10-22 09:02:06,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:06,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:06,231 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-10-22 09:02:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:06,291 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-10-22 09:02:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:06,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 09:02:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:06,296 INFO L225 Difference]: With dead ends: 2003 [2019-10-22 09:02:06,296 INFO L226 Difference]: Without dead ends: 1333 [2019-10-22 09:02:06,297 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-10-22 09:02:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-10-22 09:02:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-10-22 09:02:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-10-22 09:02:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-10-22 09:02:06,338 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-10-22 09:02:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:06,338 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-10-22 09:02:06,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-10-22 09:02:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:02:06,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:06,340 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-10-22 09:02:06,341 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-10-22 09:02:06,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:06,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492357416] [2019-10-22 09:02:06,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-22 09:02:06,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492357416] [2019-10-22 09:02:06,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:06,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:06,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114701224] [2019-10-22 09:02:06,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:06,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:06,383 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-10-22 09:02:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:06,430 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-10-22 09:02:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:06,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 09:02:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:06,432 INFO L225 Difference]: With dead ends: 1362 [2019-10-22 09:02:06,433 INFO L226 Difference]: Without dead ends: 690 [2019-10-22 09:02:06,434 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-10-22 09:02:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-22 09:02:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-10-22 09:02:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-10-22 09:02:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-10-22 09:02:06,461 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-10-22 09:02:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:06,461 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-10-22 09:02:06,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-10-22 09:02:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 09:02:06,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:06,464 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-10-22 09:02:06,464 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-10-22 09:02:06,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:06,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934032198] [2019-10-22 09:02:06,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:02:06,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934032198] [2019-10-22 09:02:06,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:06,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:06,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794387944] [2019-10-22 09:02:06,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:06,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:06,515 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-10-22 09:02:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:06,587 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-10-22 09:02:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:06,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-22 09:02:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:06,591 INFO L225 Difference]: With dead ends: 2017 [2019-10-22 09:02:06,591 INFO L226 Difference]: Without dead ends: 1347 [2019-10-22 09:02:06,592 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-10-22 09:02:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-10-22 09:02:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-10-22 09:02:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-10-22 09:02:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-10-22 09:02:06,639 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-10-22 09:02:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:06,639 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-10-22 09:02:06,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-10-22 09:02:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 09:02:06,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:06,641 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-10-22 09:02:06,641 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-10-22 09:02:06,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:06,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026407059] [2019-10-22 09:02:06,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:06,732 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:06,733 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:02:06,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:06 BoogieIcfgContainer [2019-10-22 09:02:06,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:06,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:06,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:06,806 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:06,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:01" (3/4) ... [2019-10-22 09:02:06,808 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:02:06,893 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bec30144-c8d4-4b88-bed0-524283b1e46d/bin/uautomizer/witness.graphml [2019-10-22 09:02:06,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:06,895 INFO L168 Benchmark]: Toolchain (without parser) took 6853.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.4 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -260.9 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:06,895 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:06,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:06,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.79 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:06,896 INFO L168 Benchmark]: Boogie Preprocessor took 31.46 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-10-22 09:02:06,896 INFO L168 Benchmark]: RCFGBuilder took 847.97 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:06,897 INFO L168 Benchmark]: TraceAbstraction took 5380.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -146.5 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:06,897 INFO L168 Benchmark]: Witness Printer took 88.00 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:06,900 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.79 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.46 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 847.97 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: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5380.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -146.5 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. * Witness Printer took 88.00 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L648] int s ; [L649] int tmp ; [L653] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND FALSE !(tmp___1 + 12288) [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L302] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L303] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L304] COND TRUE __cil_tmp56 + 256UL [L305] skip = 1 [L316] s__state = 8528 [L317] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L321] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L322] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L324] __cil_tmp57 = (unsigned long )s__options [L325] COND TRUE __cil_tmp57 + 2097152UL [L326] s__s3__tmp__use_rsa_tmp = 1 [L331] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L358] ret = __VERIFIER_nondet_int() [L359] COND FALSE !(blastFlag == 6) [L362] COND FALSE !(ret <= 0) [L379] s__state = 8544 [L380] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND TRUE ! s__s3__tmp__reuse_message [L602] COND TRUE ! skip [L603] COND TRUE state == 8528 [L604] COND TRUE s__state == 8544 [L605] COND TRUE tmp___7 != 1024 [L606] COND TRUE tmp___7 != 512 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE l != 4294967266 [L643] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.3s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...