./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.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_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/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 d203fdfca57a36b6738b0f9dc4164fa3855180e7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:02:17,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:17,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:17,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:17,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:17,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:17,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:17,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:17,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:17,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:17,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:17,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:17,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:17,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:17,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:17,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:17,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:17,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:17,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:17,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:17,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:17,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:17,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:17,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:17,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:17,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:17,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:17,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:17,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:17,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:17,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:17,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:17,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:17,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:17,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:17,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:17,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:17,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:17,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:17,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:17,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:17,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:17,070 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:17,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:17,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:17,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:17,072 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:17,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:17,072 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:17,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:17,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:17,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:17,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:17,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:17,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:17,073 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:17,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:17,074 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:17,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:17,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:17,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:17,074 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:17,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:17,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:17,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:17,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:17,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:17,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:17,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:17,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:17,076 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_48da5a06-f180-463f-9c07-cfc0fb7ab461/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 -> d203fdfca57a36b6738b0f9dc4164fa3855180e7 [2019-10-22 09:02:17,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:17,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:17,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:17,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:17,141 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:17,142 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-10-22 09:02:17,193 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/data/110425896/6eba9f33701a4138a3ff86bb2fa0f7c6/FLAG0a27d70a0 [2019-10-22 09:02:17,624 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:17,624 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-10-22 09:02:17,648 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/data/110425896/6eba9f33701a4138a3ff86bb2fa0f7c6/FLAG0a27d70a0 [2019-10-22 09:02:17,970 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/data/110425896/6eba9f33701a4138a3ff86bb2fa0f7c6 [2019-10-22 09:02:17,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:17,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:17,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:17,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:17,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:17,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:17" (1/1) ... [2019-10-22 09:02:17,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8242a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:17, skipping insertion in model container [2019-10-22 09:02:17,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:17" (1/1) ... [2019-10-22 09:02:17,995 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:18,055 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:18,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:18,402 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:18,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:18,538 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:18,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:18 WrapperNode [2019-10-22 09:02:18,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:18,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:18,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:18,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:18,551 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:18" (1/1) ... [2019-10-22 09:02:18,575 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:18" (1/1) ... [2019-10-22 09:02:18,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:18,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:18,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:18,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:18,644 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:18" (1/1) ... [2019-10-22 09:02:18,644 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:18" (1/1) ... [2019-10-22 09:02:18,655 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:18" (1/1) ... [2019-10-22 09:02:18,655 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:18" (1/1) ... [2019-10-22 09:02:18,674 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:18" (1/1) ... [2019-10-22 09:02:18,690 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:18" (1/1) ... [2019-10-22 09:02:18,699 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:18" (1/1) ... [2019-10-22 09:02:18,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:18,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:18,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:18,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:18,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/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:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:18,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:18,924 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:02:19,617 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 09:02:19,618 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 09:02:19,619 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:19,619 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:19,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:19 BoogieIcfgContainer [2019-10-22 09:02:19,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:19,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:19,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:19,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:19,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:17" (1/3) ... [2019-10-22 09:02:19,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61923360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:19, skipping insertion in model container [2019-10-22 09:02:19,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:18" (2/3) ... [2019-10-22 09:02:19,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61923360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:19, skipping insertion in model container [2019-10-22 09:02:19,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:19" (3/3) ... [2019-10-22 09:02:19,632 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-10-22 09:02:19,643 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:19,652 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:02:19,664 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:02:19,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:19,698 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:19,698 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:19,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:19,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:19,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:19,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:19,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-10-22 09:02:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:02:19,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:19,732 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:19,735 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-10-22 09:02:19,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:19,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773648120] [2019-10-22 09:02:19,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:19,934 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:19,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773648120] [2019-10-22 09:02:19,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:19,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:19,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548505714] [2019-10-22 09:02:19,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:19,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:19,957 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-10-22 09:02:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:20,197 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-10-22 09:02:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:20,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 09:02:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:20,211 INFO L225 Difference]: With dead ends: 352 [2019-10-22 09:02:20,212 INFO L226 Difference]: Without dead ends: 173 [2019-10-22 09:02:20,215 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:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-22 09:02:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-22 09:02:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-22 09:02:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-10-22 09:02:20,266 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-10-22 09:02:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:20,267 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-10-22 09:02:20,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-10-22 09:02:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:20,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:20,268 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:20,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-10-22 09:02:20,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110687518] [2019-10-22 09:02:20,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:20,329 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:20,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110687518] [2019-10-22 09:02:20,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:20,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:20,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952780408] [2019-10-22 09:02:20,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:20,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:20,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:20,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:20,332 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-10-22 09:02:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:20,482 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-10-22 09:02:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:20,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:02:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:20,485 INFO L225 Difference]: With dead ends: 357 [2019-10-22 09:02:20,485 INFO L226 Difference]: Without dead ends: 193 [2019-10-22 09:02:20,486 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:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-22 09:02:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-10-22 09:02:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-22 09:02:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-10-22 09:02:20,509 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-10-22 09:02:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:20,509 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-10-22 09:02:20,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-10-22 09:02:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:20,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:20,510 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:20,511 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:20,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-10-22 09:02:20,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842337781] [2019-10-22 09:02:20,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:20,580 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:20,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842337781] [2019-10-22 09:02:20,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:20,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:20,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012782405] [2019-10-22 09:02:20,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:20,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:20,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:20,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:20,582 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-10-22 09:02:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:20,728 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-10-22 09:02:20,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:20,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:02:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:20,731 INFO L225 Difference]: With dead ends: 387 [2019-10-22 09:02:20,731 INFO L226 Difference]: Without dead ends: 201 [2019-10-22 09:02:20,732 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:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-22 09:02:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-10-22 09:02:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-22 09:02:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-10-22 09:02:20,756 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-10-22 09:02:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:20,756 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-10-22 09:02:20,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-10-22 09:02:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:20,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:20,761 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:20,761 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-10-22 09:02:20,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310044450] [2019-10-22 09:02:20,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:20,833 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:20,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310044450] [2019-10-22 09:02:20,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:20,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:20,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872824828] [2019-10-22 09:02:20,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:20,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:20,835 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-10-22 09:02:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:20,976 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-10-22 09:02:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:20,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:02:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:20,978 INFO L225 Difference]: With dead ends: 392 [2019-10-22 09:02:20,978 INFO L226 Difference]: Without dead ends: 200 [2019-10-22 09:02:20,979 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:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-22 09:02:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-10-22 09:02:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 09:02:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-10-22 09:02:20,991 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-10-22 09:02:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:20,991 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-10-22 09:02:20,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-10-22 09:02:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:20,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:20,992 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:20,993 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-10-22 09:02:20,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089154824] [2019-10-22 09:02:20,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,023 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:21,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089154824] [2019-10-22 09:02:21,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:21,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:21,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037273468] [2019-10-22 09:02:21,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:21,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:21,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:21,025 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-10-22 09:02:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:21,152 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-10-22 09:02:21,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:21,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 09:02:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:21,154 INFO L225 Difference]: With dead ends: 403 [2019-10-22 09:02:21,154 INFO L226 Difference]: Without dead ends: 210 [2019-10-22 09:02:21,154 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:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-22 09:02:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-10-22 09:02:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 09:02:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-10-22 09:02:21,171 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-10-22 09:02:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:21,171 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-10-22 09:02:21,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-10-22 09:02:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 09:02:21,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:21,173 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] [2019-10-22 09:02:21,173 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-10-22 09:02:21,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809128761] [2019-10-22 09:02:21,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,245 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:21,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809128761] [2019-10-22 09:02:21,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:21,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:21,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824887191] [2019-10-22 09:02:21,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:21,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:21,247 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-10-22 09:02:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:21,360 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-10-22 09:02:21,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:21,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 09:02:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:21,362 INFO L225 Difference]: With dead ends: 403 [2019-10-22 09:02:21,362 INFO L226 Difference]: Without dead ends: 210 [2019-10-22 09:02:21,363 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:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-22 09:02:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-10-22 09:02:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 09:02:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-10-22 09:02:21,380 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-10-22 09:02:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:21,380 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-10-22 09:02:21,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-10-22 09:02:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 09:02:21,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:21,386 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] [2019-10-22 09:02:21,386 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-10-22 09:02:21,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574141521] [2019-10-22 09:02:21,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,424 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:21,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574141521] [2019-10-22 09:02:21,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:21,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:21,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268528144] [2019-10-22 09:02:21,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:21,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:21,426 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-10-22 09:02:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:21,556 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-10-22 09:02:21,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:21,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 09:02:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:21,558 INFO L225 Difference]: With dead ends: 403 [2019-10-22 09:02:21,558 INFO L226 Difference]: Without dead ends: 210 [2019-10-22 09:02:21,559 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:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-22 09:02:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-10-22 09:02:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 09:02:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-10-22 09:02:21,570 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-10-22 09:02:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:21,572 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-10-22 09:02:21,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-10-22 09:02:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 09:02:21,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:21,574 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] [2019-10-22 09:02:21,574 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:21,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-10-22 09:02:21,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951609838] [2019-10-22 09:02:21,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,632 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:21,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951609838] [2019-10-22 09:02:21,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:21,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:21,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514813617] [2019-10-22 09:02:21,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:21,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:21,634 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-10-22 09:02:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:21,887 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-10-22 09:02:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:21,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 09:02:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:21,890 INFO L225 Difference]: With dead ends: 599 [2019-10-22 09:02:21,890 INFO L226 Difference]: Without dead ends: 406 [2019-10-22 09:02:21,891 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:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-22 09:02:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-10-22 09:02:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-22 09:02:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-10-22 09:02:21,906 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-10-22 09:02:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:21,907 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-10-22 09:02:21,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-10-22 09:02:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 09:02:21,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:21,908 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, 1, 1, 1] [2019-10-22 09:02:21,908 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-10-22 09:02:21,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677433078] [2019-10-22 09:02:21,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,942 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:21,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677433078] [2019-10-22 09:02:21,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:21,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:21,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375927490] [2019-10-22 09:02:21,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:21,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:21,944 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-10-22 09:02:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:22,104 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-10-22 09:02:22,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:22,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 09:02:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:22,106 INFO L225 Difference]: With dead ends: 841 [2019-10-22 09:02:22,107 INFO L226 Difference]: Without dead ends: 466 [2019-10-22 09:02:22,108 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:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-22 09:02:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-10-22 09:02:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-22 09:02:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-10-22 09:02:22,127 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-10-22 09:02:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:22,127 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-10-22 09:02:22,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-10-22 09:02:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:02:22,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:22,133 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, 1, 1, 1, 1] [2019-10-22 09:02:22,134 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-10-22 09:02:22,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520201605] [2019-10-22 09:02:22,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,169 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:22,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520201605] [2019-10-22 09:02:22,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:22,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:22,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89205895] [2019-10-22 09:02:22,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:22,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:22,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:22,171 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-10-22 09:02:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:22,311 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-10-22 09:02:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:22,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 09:02:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:22,313 INFO L225 Difference]: With dead ends: 930 [2019-10-22 09:02:22,314 INFO L226 Difference]: Without dead ends: 489 [2019-10-22 09:02:22,314 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:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-10-22 09:02:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-10-22 09:02:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-22 09:02:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-10-22 09:02:22,333 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-10-22 09:02:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:22,333 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-10-22 09:02:22,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-10-22 09:02:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 09:02:22,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:22,335 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:22,335 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-10-22 09:02:22,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943479753] [2019-10-22 09:02:22,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:02:22,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943479753] [2019-10-22 09:02:22,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:22,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:22,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050517730] [2019-10-22 09:02:22,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:22,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:22,372 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-10-22 09:02:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:22,502 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-10-22 09:02:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:22,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-22 09:02:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:22,504 INFO L225 Difference]: With dead ends: 987 [2019-10-22 09:02:22,504 INFO L226 Difference]: Without dead ends: 523 [2019-10-22 09:02:22,505 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:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-22 09:02:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-10-22 09:02:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-22 09:02:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-10-22 09:02:22,523 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-10-22 09:02:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:22,523 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-10-22 09:02:22,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-10-22 09:02:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 09:02:22,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:22,526 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:22,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-10-22 09:02:22,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465551544] [2019-10-22 09:02:22,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:02:22,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465551544] [2019-10-22 09:02:22,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:22,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:22,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433130789] [2019-10-22 09:02:22,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:22,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:22,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:22,557 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-10-22 09:02:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:22,694 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-10-22 09:02:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:22,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 09:02:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:22,697 INFO L225 Difference]: With dead ends: 1021 [2019-10-22 09:02:22,697 INFO L226 Difference]: Without dead ends: 523 [2019-10-22 09:02:22,698 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:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-22 09:02:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-10-22 09:02:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-22 09:02:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-10-22 09:02:22,717 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-10-22 09:02:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:22,718 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-10-22 09:02:22,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-10-22 09:02:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 09:02:22,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:22,719 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:22,719 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-10-22 09:02:22,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859377931] [2019-10-22 09:02:22,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:02:22,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859377931] [2019-10-22 09:02:22,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:22,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:22,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102096352] [2019-10-22 09:02:22,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:22,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:22,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:22,750 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-10-22 09:02:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:22,890 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-10-22 09:02:22,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:22,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 09:02:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:22,894 INFO L225 Difference]: With dead ends: 1068 [2019-10-22 09:02:22,895 INFO L226 Difference]: Without dead ends: 570 [2019-10-22 09:02:22,896 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:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-22 09:02:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-10-22 09:02:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-22 09:02:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-10-22 09:02:22,916 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-10-22 09:02:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:22,916 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-10-22 09:02:22,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-10-22 09:02:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 09:02:22,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:22,918 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, 1, 1, 1, 1, 1] [2019-10-22 09:02:22,918 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-10-22 09:02:22,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:22,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707049027] [2019-10-22 09:02:22,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:22,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:22,968 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:22,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707049027] [2019-10-22 09:02:22,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:22,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:22,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549041439] [2019-10-22 09:02:22,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:22,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:22,970 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-10-22 09:02:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,113 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-10-22 09:02:23,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:23,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-10-22 09:02:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:23,116 INFO L225 Difference]: With dead ends: 1178 [2019-10-22 09:02:23,117 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 09:02:23,118 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:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 09:02:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-10-22 09:02:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 09:02:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-10-22 09:02:23,141 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-10-22 09:02:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:23,142 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-10-22 09:02:23,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-10-22 09:02:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 09:02:23,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:23,143 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, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,143 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-10-22 09:02:23,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864339953] [2019-10-22 09:02:23,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,176 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:23,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864339953] [2019-10-22 09:02:23,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:23,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023340783] [2019-10-22 09:02:23,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:23,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:23,179 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-10-22 09:02:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,346 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-10-22 09:02:23,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:23,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-22 09:02:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:23,349 INFO L225 Difference]: With dead ends: 1221 [2019-10-22 09:02:23,349 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 09:02:23,351 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:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 09:02:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-10-22 09:02:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 09:02:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-10-22 09:02:23,379 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-10-22 09:02:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:23,379 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-10-22 09:02:23,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-10-22 09:02:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:02:23,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:23,381 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,381 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-10-22 09:02:23,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334215785] [2019-10-22 09:02:23,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:02:23,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334215785] [2019-10-22 09:02:23,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:23,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824724183] [2019-10-22 09:02:23,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:23,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:23,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:23,421 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-10-22 09:02:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,579 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-10-22 09:02:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:23,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:02:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:23,582 INFO L225 Difference]: With dead ends: 1217 [2019-10-22 09:02:23,582 INFO L226 Difference]: Without dead ends: 613 [2019-10-22 09:02:23,583 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:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-22 09:02:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-10-22 09:02:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 09:02:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-10-22 09:02:23,605 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-10-22 09:02:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:23,605 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-10-22 09:02:23,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-10-22 09:02:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:02:23,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:23,607 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,608 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-10-22 09:02:23,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333577148] [2019-10-22 09:02:23,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 09:02:23,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333577148] [2019-10-22 09:02:23,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:23,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34238295] [2019-10-22 09:02:23,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:23,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:23,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:23,646 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-10-22 09:02:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,785 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-10-22 09:02:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:23,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 09:02:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:23,788 INFO L225 Difference]: With dead ends: 1275 [2019-10-22 09:02:23,788 INFO L226 Difference]: Without dead ends: 671 [2019-10-22 09:02:23,789 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:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-22 09:02:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-10-22 09:02:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-22 09:02:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-10-22 09:02:23,815 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-10-22 09:02:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:23,815 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-10-22 09:02:23,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-10-22 09:02:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-22 09:02:23,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:23,817 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, 1, 1, 1, 1, 1, 1, 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:23,817 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-10-22 09:02:23,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236248204] [2019-10-22 09:02:23,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 09:02:23,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236248204] [2019-10-22 09:02:23,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:23,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035135007] [2019-10-22 09:02:23,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:23,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:23,847 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-10-22 09:02:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,982 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-10-22 09:02:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:23,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-22 09:02:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:23,985 INFO L225 Difference]: With dead ends: 1307 [2019-10-22 09:02:23,985 INFO L226 Difference]: Without dead ends: 671 [2019-10-22 09:02:23,986 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:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-22 09:02:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-10-22 09:02:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-22 09:02:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-10-22 09:02:24,010 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-10-22 09:02:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:24,010 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-10-22 09:02:24,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-10-22 09:02:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:02:24,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:24,011 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,012 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-10-22 09:02:24,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499636855] [2019-10-22 09:02:24,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:02:24,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499636855] [2019-10-22 09:02:24,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:24,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118666263] [2019-10-22 09:02:24,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:24,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,041 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-10-22 09:02:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,199 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-10-22 09:02:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 09:02:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:24,202 INFO L225 Difference]: With dead ends: 1343 [2019-10-22 09:02:24,202 INFO L226 Difference]: Without dead ends: 707 [2019-10-22 09:02:24,203 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:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-10-22 09:02:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-10-22 09:02:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-10-22 09:02:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-10-22 09:02:24,227 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-10-22 09:02:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:24,228 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-10-22 09:02:24,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-10-22 09:02:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:02:24,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:24,230 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,230 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-10-22 09:02:24,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220098788] [2019-10-22 09:02:24,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:02:24,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220098788] [2019-10-22 09:02:24,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:24,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287241122] [2019-10-22 09:02:24,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:24,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,259 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-10-22 09:02:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,411 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-10-22 09:02:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 09:02:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:24,413 INFO L225 Difference]: With dead ends: 1400 [2019-10-22 09:02:24,414 INFO L226 Difference]: Without dead ends: 708 [2019-10-22 09:02:24,415 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:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-10-22 09:02:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-10-22 09:02:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-22 09:02:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-10-22 09:02:24,438 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-10-22 09:02:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:24,438 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-10-22 09:02:24,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-10-22 09:02:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-22 09:02:24,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:24,440 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,440 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-10-22 09:02:24,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032905956] [2019-10-22 09:02:24,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 09:02:24,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032905956] [2019-10-22 09:02:24,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:24,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858469965] [2019-10-22 09:02:24,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:24,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,470 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-10-22 09:02:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,609 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-10-22 09:02:24,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-22 09:02:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:24,611 INFO L225 Difference]: With dead ends: 1432 [2019-10-22 09:02:24,611 INFO L226 Difference]: Without dead ends: 743 [2019-10-22 09:02:24,612 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:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-10-22 09:02:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-10-22 09:02:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-22 09:02:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-10-22 09:02:24,636 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-10-22 09:02:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:24,636 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-10-22 09:02:24,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-10-22 09:02:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-22 09:02:24,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:24,638 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 09:02:24,638 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-10-22 09:02:24,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655796697] [2019-10-22 09:02:24,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 09:02:24,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655796697] [2019-10-22 09:02:24,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:24,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678312214] [2019-10-22 09:02:24,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:24,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,667 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-10-22 09:02:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,818 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-10-22 09:02:24,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:24,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-22 09:02:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:24,821 INFO L225 Difference]: With dead ends: 1473 [2019-10-22 09:02:24,821 INFO L226 Difference]: Without dead ends: 743 [2019-10-22 09:02:24,822 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:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-10-22 09:02:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-10-22 09:02:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-22 09:02:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-10-22 09:02:24,854 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-10-22 09:02:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:24,854 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-10-22 09:02:24,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-10-22 09:02:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-22 09:02:24,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:24,856 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,857 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-10-22 09:02:24,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994492916] [2019-10-22 09:02:24,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-22 09:02:24,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994492916] [2019-10-22 09:02:24,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:24,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:24,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369381617] [2019-10-22 09:02:24,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:24,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:24,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:24,893 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-10-22 09:02:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,042 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-10-22 09:02:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:25,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-22 09:02:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:25,045 INFO L225 Difference]: With dead ends: 1509 [2019-10-22 09:02:25,045 INFO L226 Difference]: Without dead ends: 779 [2019-10-22 09:02:25,046 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:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-22 09:02:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-10-22 09:02:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-10-22 09:02:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-10-22 09:02:25,073 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-10-22 09:02:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:25,073 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-10-22 09:02:25,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-10-22 09:02:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-22 09:02:25,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:25,075 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,076 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-10-22 09:02:25,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249866182] [2019-10-22 09:02:25,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-22 09:02:25,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249866182] [2019-10-22 09:02:25,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:25,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382295455] [2019-10-22 09:02:25,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:25,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,110 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-10-22 09:02:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,256 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-10-22 09:02:25,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:25,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-22 09:02:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:25,259 INFO L225 Difference]: With dead ends: 1541 [2019-10-22 09:02:25,259 INFO L226 Difference]: Without dead ends: 779 [2019-10-22 09:02:25,260 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:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-22 09:02:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-10-22 09:02:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-10-22 09:02:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-10-22 09:02:25,290 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-10-22 09:02:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:25,290 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-10-22 09:02:25,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-10-22 09:02:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-22 09:02:25,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:25,292 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,293 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-10-22 09:02:25,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451999689] [2019-10-22 09:02:25,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-22 09:02:25,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451999689] [2019-10-22 09:02:25,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:25,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479061919] [2019-10-22 09:02:25,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:25,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,325 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-10-22 09:02:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,461 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-10-22 09:02:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:25,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-22 09:02:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:25,464 INFO L225 Difference]: With dead ends: 1567 [2019-10-22 09:02:25,465 INFO L226 Difference]: Without dead ends: 805 [2019-10-22 09:02:25,466 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:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-22 09:02:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-10-22 09:02:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-22 09:02:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-10-22 09:02:25,495 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-10-22 09:02:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:25,495 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-10-22 09:02:25,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-10-22 09:02:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-22 09:02:25,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:25,497 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,498 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-10-22 09:02:25,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615568683] [2019-10-22 09:02:25,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-22 09:02:25,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615568683] [2019-10-22 09:02:25,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:25,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371420550] [2019-10-22 09:02:25,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:25,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,539 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-10-22 09:02:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,673 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-10-22 09:02:25,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:25,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-22 09:02:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:25,676 INFO L225 Difference]: With dead ends: 1595 [2019-10-22 09:02:25,676 INFO L226 Difference]: Without dead ends: 805 [2019-10-22 09:02:25,677 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:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-22 09:02:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-10-22 09:02:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-22 09:02:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-10-22 09:02:25,709 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-10-22 09:02:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:25,709 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-10-22 09:02:25,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-10-22 09:02:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-22 09:02:25,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:25,712 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,713 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-10-22 09:02:25,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748131619] [2019-10-22 09:02:25,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-22 09:02:25,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748131619] [2019-10-22 09:02:25,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:25,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278975992] [2019-10-22 09:02:25,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:25,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,749 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-10-22 09:02:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:25,907 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-10-22 09:02:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:25,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-22 09:02:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:25,910 INFO L225 Difference]: With dead ends: 1650 [2019-10-22 09:02:25,911 INFO L226 Difference]: Without dead ends: 860 [2019-10-22 09:02:25,912 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:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-22 09:02:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-10-22 09:02:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-10-22 09:02:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-10-22 09:02:25,938 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-10-22 09:02:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:25,939 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-10-22 09:02:25,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-10-22 09:02:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-22 09:02:25,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:25,941 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:25,941 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-10-22 09:02:25,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:25,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892369612] [2019-10-22 09:02:25,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:25,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-22 09:02:25,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892369612] [2019-10-22 09:02:25,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:25,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:25,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668200754] [2019-10-22 09:02:25,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:25,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:25,984 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-10-22 09:02:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:26,138 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-10-22 09:02:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:26,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-22 09:02:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:26,141 INFO L225 Difference]: With dead ends: 1699 [2019-10-22 09:02:26,141 INFO L226 Difference]: Without dead ends: 844 [2019-10-22 09:02:26,142 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:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-10-22 09:02:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-10-22 09:02:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-10-22 09:02:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-10-22 09:02:26,169 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-10-22 09:02:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:26,169 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-10-22 09:02:26,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-10-22 09:02:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-22 09:02:26,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:26,171 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-22 09:02:26,171 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:26,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-10-22 09:02:26,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211706313] [2019-10-22 09:02:26,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-22 09:02:26,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211706313] [2019-10-22 09:02:26,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:26,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:26,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226796910] [2019-10-22 09:02:26,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:26,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:26,205 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-10-22 09:02:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:26,365 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-10-22 09:02:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:26,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-22 09:02:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:26,368 INFO L225 Difference]: With dead ends: 1665 [2019-10-22 09:02:26,368 INFO L226 Difference]: Without dead ends: 842 [2019-10-22 09:02:26,369 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:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-22 09:02:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-10-22 09:02:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-10-22 09:02:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-10-22 09:02:26,395 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-10-22 09:02:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:26,395 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-10-22 09:02:26,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-10-22 09:02:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-22 09:02:26,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:26,398 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-22 09:02:26,398 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:26,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-10-22 09:02:26,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328771077] [2019-10-22 09:02:26,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-22 09:02:26,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328771077] [2019-10-22 09:02:26,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:26,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:26,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167695130] [2019-10-22 09:02:26,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:26,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:26,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:26,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:26,433 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-10-22 09:02:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:26,563 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-10-22 09:02:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:26,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-22 09:02:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:26,566 INFO L225 Difference]: With dead ends: 1665 [2019-10-22 09:02:26,566 INFO L226 Difference]: Without dead ends: 825 [2019-10-22 09:02:26,568 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:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-10-22 09:02:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-10-22 09:02:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-10-22 09:02:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-10-22 09:02:26,641 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-10-22 09:02:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:26,641 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-10-22 09:02:26,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-10-22 09:02:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-22 09:02:26,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:26,643 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:26,643 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:26,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-10-22 09:02:26,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006871590] [2019-10-22 09:02:26,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-22 09:02:26,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006871590] [2019-10-22 09:02:26,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:26,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:26,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729329785] [2019-10-22 09:02:26,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:26,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:26,700 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-10-22 09:02:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:26,744 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-10-22 09:02:26,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:26,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-22 09:02:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:26,749 INFO L225 Difference]: With dead ends: 2411 [2019-10-22 09:02:26,749 INFO L226 Difference]: Without dead ends: 1605 [2019-10-22 09:02:26,750 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:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-10-22 09:02:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-10-22 09:02:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-10-22 09:02:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-10-22 09:02:26,783 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-10-22 09:02:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:26,783 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-10-22 09:02:26,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-10-22 09:02:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-22 09:02:26,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:26,785 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:26,785 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-10-22 09:02:26,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548622398] [2019-10-22 09:02:26,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-22 09:02:26,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548622398] [2019-10-22 09:02:26,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:26,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:26,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655524105] [2019-10-22 09:02:26,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:26,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:26,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:26,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:26,838 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-10-22 09:02:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:26,896 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-10-22 09:02:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:26,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-22 09:02:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:26,901 INFO L225 Difference]: With dead ends: 2410 [2019-10-22 09:02:26,901 INFO L226 Difference]: Without dead ends: 1602 [2019-10-22 09:02:26,902 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:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-10-22 09:02:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-10-22 09:02:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-10-22 09:02:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-10-22 09:02:26,959 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-10-22 09:02:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:26,960 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-10-22 09:02:26,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-10-22 09:02:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-22 09:02:26,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:26,962 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:26,962 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:26,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:26,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-10-22 09:02:26,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:26,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641186673] [2019-10-22 09:02:26,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:26,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-22 09:02:27,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641186673] [2019-10-22 09:02:27,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:27,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:27,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154713588] [2019-10-22 09:02:27,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:27,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:27,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:27,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:27,052 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-10-22 09:02:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:27,166 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-10-22 09:02:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:27,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-22 09:02:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:27,175 INFO L225 Difference]: With dead ends: 4746 [2019-10-22 09:02:27,175 INFO L226 Difference]: Without dead ends: 3153 [2019-10-22 09:02:27,177 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:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-10-22 09:02:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-10-22 09:02:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-10-22 09:02:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-10-22 09:02:27,249 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-10-22 09:02:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:27,250 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-10-22 09:02:27,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-10-22 09:02:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 09:02:27,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:27,251 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:27,252 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-10-22 09:02:27,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663032830] [2019-10-22 09:02:27,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-22 09:02:27,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663032830] [2019-10-22 09:02:27,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:27,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:27,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830248761] [2019-10-22 09:02:27,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:27,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:27,296 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-10-22 09:02:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:27,491 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-10-22 09:02:27,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:27,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-22 09:02:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:27,501 INFO L225 Difference]: With dead ends: 4786 [2019-10-22 09:02:27,502 INFO L226 Difference]: Without dead ends: 3193 [2019-10-22 09:02:27,504 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:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-10-22 09:02:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-10-22 09:02:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-10-22 09:02:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-10-22 09:02:27,657 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-10-22 09:02:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:27,658 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-10-22 09:02:27,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-10-22 09:02:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 09:02:27,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:27,660 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:27,661 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-10-22 09:02:27,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589126702] [2019-10-22 09:02:27,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:27,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:27,756 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:02:27,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:27 BoogieIcfgContainer [2019-10-22 09:02:27,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:27,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:27,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:27,814 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:27,814 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:19" (3/4) ... [2019-10-22 09:02:27,816 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:02:27,906 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_48da5a06-f180-463f-9c07-cfc0fb7ab461/bin/uautomizer/witness.graphml [2019-10-22 09:02:27,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:27,910 INFO L168 Benchmark]: Toolchain (without parser) took 9934.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 945.8 MB in the beginning and 1.3 GB in the end (delta: -318.0 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:27,910 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:27,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:27,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:27,911 INFO L168 Benchmark]: Boogie Preprocessor took 72.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:27,911 INFO L168 Benchmark]: RCFGBuilder took 915.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:27,911 INFO L168 Benchmark]: TraceAbstraction took 8191.61 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 258.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -258.3 MB). Peak memory consumption was 158.4 kB. Max. memory is 11.5 GB. [2019-10-22 09:02:27,912 INFO L168 Benchmark]: Witness Printer took 94.69 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:27,913 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 561.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 915.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8191.61 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 258.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -258.3 MB). Peak memory consumption was 158.4 kB. Max. memory is 11.5 GB. * Witness Printer took 94.69 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 698]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L703] int s ; [L704] int tmp ; [L708] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L75] s__state = initial_state [L76] blastFlag = 0 [L77] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 + 12288) [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L291] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 8512 [L299] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND TRUE s__state == 8512 [L304] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L305] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L306] COND TRUE __cil_tmp56 + 256UL [L307] __cil_tmp56 = 256345 [L308] skip = 1 [L319] s__state = 8528 [L320] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND TRUE s__state == 8528 [L324] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L325] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L327] __cil_tmp57 = (unsigned long )s__options [L328] COND TRUE __cil_tmp57 + 2097152UL [L329] s__s3__tmp__use_rsa_tmp = 1 [L334] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L362] ret = __VERIFIER_nondet_int() [L363] COND FALSE !(blastFlag == 3) [L366] COND FALSE !(ret <= 0) [L383] s__state = 8544 [L384] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND TRUE s__state == 8544 [L388] COND TRUE s__verify_mode + 1 [L389] COND TRUE s__session__peer != 0 [L390] COND TRUE s__verify_mode + 4 [L391] s__verify_mode = 123 [L392] skip = 1 [L393] s__s3__tmp__cert_request = 0 [L394] s__state = 8560 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND TRUE s__state == 8560 [L438] ret = __VERIFIER_nondet_int() [L439] COND FALSE !(ret <= 0) [L442] s__s3__tmp__next_state___0 = 8576 [L443] s__state = 8448 [L444] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND TRUE ! s__s3__tmp__reuse_message [L654] COND TRUE ! skip [L655] COND TRUE state == 8560 [L656] COND TRUE s__state == 8448 [L657] COND TRUE s__verify_mode != -1 [L658] COND TRUE s__verify_mode != -2 [L659] COND TRUE __cil_tmp61 != 9021 [L660] COND TRUE __cil_tmp58 != 4294967294 [L661] COND TRUE blastFlag != 4 [L662] COND TRUE tmp___7 != 1024 [L698] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.1s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 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...