./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8822f5291178e45ba1da62c4d4636880280d6cc4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-a4ecdab [2020-11-30 01:41:01,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:41:01,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:41:01,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:41:01,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:41:01,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:41:01,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:41:01,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:41:01,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:41:01,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:41:01,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:41:01,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:41:01,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:41:01,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:41:01,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:41:01,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:41:01,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:41:01,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:41:01,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:41:01,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:41:01,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:41:01,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:41:01,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:41:01,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:41:01,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:41:01,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:41:01,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:41:01,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:41:01,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:41:01,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:41:01,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:41:01,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:41:01,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:41:01,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:41:01,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:41:01,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:41:01,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:41:01,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:41:01,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:41:01,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:41:01,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:41:01,705 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 01:41:01,746 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:41:01,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:41:01,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:41:01,748 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:41:01,748 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:41:01,749 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:41:01,749 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 01:41:01,749 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:41:01,749 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:41:01,749 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 01:41:01,751 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 01:41:01,751 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:41:01,751 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 01:41:01,751 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 01:41:01,752 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 01:41:01,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:41:01,752 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:41:01,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:41:01,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:41:01,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:41:01,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:41:01,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:41:01,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:41:01,754 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:41:01,754 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:41:01,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:41:01,754 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:41:01,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:41:01,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:41:01,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:41:01,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:41:01,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:41:01,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:41:01,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:41:01,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:41:01,758 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 01:41:01,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:41:01,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:41:01,759 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:41:01,759 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:41:01,759 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 8822f5291178e45ba1da62c4d4636880280d6cc4 [2020-11-30 01:41:02,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:41:02,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:41:02,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:41:02,068 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:41:02,073 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:41:02,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2020-11-30 01:41:02,186 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/data/60da15018/438aec19d8004391839c365febecdfb0/FLAG5b6ab16ef [2020-11-30 01:41:02,677 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:41:02,678 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2020-11-30 01:41:02,714 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/data/60da15018/438aec19d8004391839c365febecdfb0/FLAG5b6ab16ef [2020-11-30 01:41:02,996 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/data/60da15018/438aec19d8004391839c365febecdfb0 [2020-11-30 01:41:02,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:41:03,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:41:03,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:41:03,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:41:03,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:41:03,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:41:02" (1/1) ... [2020-11-30 01:41:03,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62190787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03, skipping insertion in model container [2020-11-30 01:41:03,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:41:02" (1/1) ... [2020-11-30 01:41:03,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:41:03,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:41:03,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:41:03,294 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:41:03,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:41:03,436 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:41:03,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03 WrapperNode [2020-11-30 01:41:03,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:41:03,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:41:03,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:41:03,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:41:03,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:41:03,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:41:03,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:41:03,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:41:03,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... [2020-11-30 01:41:03,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:41:03,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:41:03,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:41:03,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:41:03,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/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 [2020-11-30 01:41:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:41:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:41:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:41:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:41:03,793 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 01:41:04,580 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-11-30 01:41:04,580 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-11-30 01:41:05,009 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:41:05,009 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:41:05,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:41:05 BoogieIcfgContainer [2020-11-30 01:41:05,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:41:05,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:41:05,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:41:05,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:41:05,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:41:02" (1/3) ... [2020-11-30 01:41:05,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446e6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:41:05, skipping insertion in model container [2020-11-30 01:41:05,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:41:03" (2/3) ... [2020-11-30 01:41:05,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446e6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:41:05, skipping insertion in model container [2020-11-30 01:41:05,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:41:05" (3/3) ... [2020-11-30 01:41:05,023 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2020-11-30 01:41:05,043 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:41:05,047 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:41:05,059 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:41:05,101 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:41:05,101 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:41:05,101 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:41:05,101 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:41:05,102 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:41:05,102 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:41:05,102 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:41:05,102 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:41:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2020-11-30 01:41:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:41:05,129 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:05,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:05,131 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash 67804971, now seen corresponding path program 1 times [2020-11-30 01:41:05,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:05,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934187219] [2020-11-30 01:41:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:05,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934187219] [2020-11-30 01:41:05,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:05,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:05,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253505870] [2020-11-30 01:41:05,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:05,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:05,463 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2020-11-30 01:41:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:05,679 INFO L93 Difference]: Finished difference Result 257 states and 449 transitions. [2020-11-30 01:41:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:05,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-30 01:41:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:05,691 INFO L225 Difference]: With dead ends: 257 [2020-11-30 01:41:05,691 INFO L226 Difference]: Without dead ends: 134 [2020-11-30 01:41:05,694 INFO L677 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 [2020-11-30 01:41:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-30 01:41:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-30 01:41:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-30 01:41:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2020-11-30 01:41:05,750 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 21 [2020-11-30 01:41:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:05,750 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2020-11-30 01:41:05,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2020-11-30 01:41:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:41:05,752 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:05,752 INFO L422 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] [2020-11-30 01:41:05,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:41:05,752 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash -851801969, now seen corresponding path program 1 times [2020-11-30 01:41:05,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:05,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894732121] [2020-11-30 01:41:05,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:05,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894732121] [2020-11-30 01:41:05,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:05,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:05,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655690338] [2020-11-30 01:41:05,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:05,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:05,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:05,843 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand 3 states. [2020-11-30 01:41:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:06,057 INFO L93 Difference]: Finished difference Result 275 states and 417 transitions. [2020-11-30 01:41:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:06,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-30 01:41:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:06,059 INFO L225 Difference]: With dead ends: 275 [2020-11-30 01:41:06,060 INFO L226 Difference]: Without dead ends: 143 [2020-11-30 01:41:06,061 INFO L677 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 [2020-11-30 01:41:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-11-30 01:41:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2020-11-30 01:41:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-30 01:41:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2020-11-30 01:41:06,074 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 23 [2020-11-30 01:41:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:06,074 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2020-11-30 01:41:06,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2020-11-30 01:41:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:41:06,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:06,076 INFO L422 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] [2020-11-30 01:41:06,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:41:06,076 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:06,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1079430145, now seen corresponding path program 1 times [2020-11-30 01:41:06,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:06,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614863373] [2020-11-30 01:41:06,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:06,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614863373] [2020-11-30 01:41:06,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:06,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:06,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424771389] [2020-11-30 01:41:06,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:06,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:06,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:06,141 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand 3 states. [2020-11-30 01:41:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:06,345 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2020-11-30 01:41:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:06,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-30 01:41:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:06,347 INFO L225 Difference]: With dead ends: 286 [2020-11-30 01:41:06,347 INFO L226 Difference]: Without dead ends: 153 [2020-11-30 01:41:06,348 INFO L677 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 [2020-11-30 01:41:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-11-30 01:41:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2020-11-30 01:41:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-30 01:41:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2020-11-30 01:41:06,373 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 23 [2020-11-30 01:41:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:06,373 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2020-11-30 01:41:06,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2020-11-30 01:41:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:41:06,375 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:06,375 INFO L422 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] [2020-11-30 01:41:06,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:41:06,375 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1892251717, now seen corresponding path program 1 times [2020-11-30 01:41:06,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:06,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399418308] [2020-11-30 01:41:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:06,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399418308] [2020-11-30 01:41:06,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:06,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:06,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137774962] [2020-11-30 01:41:06,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:06,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:06,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:06,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:06,464 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 3 states. [2020-11-30 01:41:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:06,661 INFO L93 Difference]: Finished difference Result 306 states and 468 transitions. [2020-11-30 01:41:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:06,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-30 01:41:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:06,663 INFO L225 Difference]: With dead ends: 306 [2020-11-30 01:41:06,663 INFO L226 Difference]: Without dead ends: 157 [2020-11-30 01:41:06,664 INFO L677 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 [2020-11-30 01:41:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-30 01:41:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-11-30 01:41:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-30 01:41:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2020-11-30 01:41:06,685 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 23 [2020-11-30 01:41:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:06,685 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2020-11-30 01:41:06,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2020-11-30 01:41:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:41:06,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:06,688 INFO L422 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] [2020-11-30 01:41:06,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:41:06,689 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1821207586, now seen corresponding path program 1 times [2020-11-30 01:41:06,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:06,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917667613] [2020-11-30 01:41:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:06,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917667613] [2020-11-30 01:41:06,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:06,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:06,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434762550] [2020-11-30 01:41:06,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:06,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:06,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:06,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:06,770 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 3 states. [2020-11-30 01:41:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:06,983 INFO L93 Difference]: Finished difference Result 320 states and 487 transitions. [2020-11-30 01:41:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:06,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-30 01:41:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:06,986 INFO L225 Difference]: With dead ends: 320 [2020-11-30 01:41:06,986 INFO L226 Difference]: Without dead ends: 165 [2020-11-30 01:41:06,987 INFO L677 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 [2020-11-30 01:41:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-30 01:41:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2020-11-30 01:41:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-30 01:41:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 238 transitions. [2020-11-30 01:41:07,007 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 238 transitions. Word has length 24 [2020-11-30 01:41:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:07,007 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 238 transitions. [2020-11-30 01:41:07,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 238 transitions. [2020-11-30 01:41:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:41:07,013 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:07,013 INFO L422 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] [2020-11-30 01:41:07,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:41:07,014 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1928779988, now seen corresponding path program 1 times [2020-11-30 01:41:07,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:07,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097178633] [2020-11-30 01:41:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:07,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097178633] [2020-11-30 01:41:07,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:07,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:07,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525396167] [2020-11-30 01:41:07,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:07,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:07,097 INFO L87 Difference]: Start difference. First operand 157 states and 238 transitions. Second operand 3 states. [2020-11-30 01:41:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:07,269 INFO L93 Difference]: Finished difference Result 314 states and 476 transitions. [2020-11-30 01:41:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:07,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-30 01:41:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:07,271 INFO L225 Difference]: With dead ends: 314 [2020-11-30 01:41:07,271 INFO L226 Difference]: Without dead ends: 159 [2020-11-30 01:41:07,272 INFO L677 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 [2020-11-30 01:41:07,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-30 01:41:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2020-11-30 01:41:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-30 01:41:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2020-11-30 01:41:07,290 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 24 [2020-11-30 01:41:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:07,290 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2020-11-30 01:41:07,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2020-11-30 01:41:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:41:07,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:07,292 INFO L422 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] [2020-11-30 01:41:07,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:41:07,292 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1142234188, now seen corresponding path program 1 times [2020-11-30 01:41:07,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:07,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952059842] [2020-11-30 01:41:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:07,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952059842] [2020-11-30 01:41:07,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:07,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:07,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52363422] [2020-11-30 01:41:07,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:07,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:07,352 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand 3 states. [2020-11-30 01:41:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:07,554 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2020-11-30 01:41:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:07,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-11-30 01:41:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:07,556 INFO L225 Difference]: With dead ends: 320 [2020-11-30 01:41:07,556 INFO L226 Difference]: Without dead ends: 165 [2020-11-30 01:41:07,557 INFO L677 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 [2020-11-30 01:41:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-30 01:41:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2020-11-30 01:41:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-30 01:41:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2020-11-30 01:41:07,566 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 25 [2020-11-30 01:41:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:07,566 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2020-11-30 01:41:07,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2020-11-30 01:41:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:41:07,572 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:07,572 INFO L422 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] [2020-11-30 01:41:07,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:41:07,572 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1552959271, now seen corresponding path program 1 times [2020-11-30 01:41:07,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:07,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945048727] [2020-11-30 01:41:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:07,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945048727] [2020-11-30 01:41:07,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:07,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:07,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534016652] [2020-11-30 01:41:07,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:07,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:07,643 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand 3 states. [2020-11-30 01:41:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:07,809 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2020-11-30 01:41:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:07,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-11-30 01:41:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:07,812 INFO L225 Difference]: With dead ends: 320 [2020-11-30 01:41:07,812 INFO L226 Difference]: Without dead ends: 165 [2020-11-30 01:41:07,812 INFO L677 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 [2020-11-30 01:41:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-30 01:41:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2020-11-30 01:41:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-30 01:41:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2020-11-30 01:41:07,823 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 26 [2020-11-30 01:41:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:07,823 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2020-11-30 01:41:07,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2020-11-30 01:41:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:41:07,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:07,824 INFO L422 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] [2020-11-30 01:41:07,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:41:07,825 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1810180417, now seen corresponding path program 1 times [2020-11-30 01:41:07,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:07,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941965761] [2020-11-30 01:41:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:07,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941965761] [2020-11-30 01:41:07,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:07,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:41:07,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659896098] [2020-11-30 01:41:07,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:41:07,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:07,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:41:07,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:41:07,897 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand 4 states. [2020-11-30 01:41:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:08,220 INFO L93 Difference]: Finished difference Result 446 states and 659 transitions. [2020-11-30 01:41:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:41:08,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-30 01:41:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:08,223 INFO L225 Difference]: With dead ends: 446 [2020-11-30 01:41:08,223 INFO L226 Difference]: Without dead ends: 291 [2020-11-30 01:41:08,224 INFO L677 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 [2020-11-30 01:41:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-11-30 01:41:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 267. [2020-11-30 01:41:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2020-11-30 01:41:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 397 transitions. [2020-11-30 01:41:08,240 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 397 transitions. Word has length 26 [2020-11-30 01:41:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:08,241 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 397 transitions. [2020-11-30 01:41:08,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:41:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 397 transitions. [2020-11-30 01:41:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 01:41:08,242 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:08,242 INFO L422 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] [2020-11-30 01:41:08,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:41:08,243 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1633663458, now seen corresponding path program 1 times [2020-11-30 01:41:08,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:08,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449641537] [2020-11-30 01:41:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:08,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449641537] [2020-11-30 01:41:08,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:08,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:08,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867543520] [2020-11-30 01:41:08,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:08,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:08,291 INFO L87 Difference]: Start difference. First operand 267 states and 397 transitions. Second operand 3 states. [2020-11-30 01:41:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:08,548 INFO L93 Difference]: Finished difference Result 612 states and 929 transitions. [2020-11-30 01:41:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:08,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-30 01:41:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:08,551 INFO L225 Difference]: With dead ends: 612 [2020-11-30 01:41:08,551 INFO L226 Difference]: Without dead ends: 347 [2020-11-30 01:41:08,552 INFO L677 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 [2020-11-30 01:41:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-11-30 01:41:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 331. [2020-11-30 01:41:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-11-30 01:41:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 507 transitions. [2020-11-30 01:41:08,578 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 507 transitions. Word has length 39 [2020-11-30 01:41:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:08,578 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 507 transitions. [2020-11-30 01:41:08,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 507 transitions. [2020-11-30 01:41:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 01:41:08,580 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:08,581 INFO L422 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] [2020-11-30 01:41:08,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:41:08,581 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 949334000, now seen corresponding path program 1 times [2020-11-30 01:41:08,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:08,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901073722] [2020-11-30 01:41:08,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:08,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901073722] [2020-11-30 01:41:08,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:08,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:08,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382560520] [2020-11-30 01:41:08,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:08,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:08,645 INFO L87 Difference]: Start difference. First operand 331 states and 507 transitions. Second operand 3 states. [2020-11-30 01:41:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:08,877 INFO L93 Difference]: Finished difference Result 670 states and 1027 transitions. [2020-11-30 01:41:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:08,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-11-30 01:41:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:08,881 INFO L225 Difference]: With dead ends: 670 [2020-11-30 01:41:08,881 INFO L226 Difference]: Without dead ends: 341 [2020-11-30 01:41:08,882 INFO L677 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 [2020-11-30 01:41:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-11-30 01:41:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 332. [2020-11-30 01:41:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-11-30 01:41:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2020-11-30 01:41:08,902 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 40 [2020-11-30 01:41:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:08,904 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2020-11-30 01:41:08,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2020-11-30 01:41:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-30 01:41:08,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:08,906 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:08,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:41:08,908 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1058803859, now seen corresponding path program 1 times [2020-11-30 01:41:08,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:08,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136322527] [2020-11-30 01:41:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:41:08,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136322527] [2020-11-30 01:41:08,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:08,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:08,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576203977] [2020-11-30 01:41:08,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:08,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:08,977 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand 3 states. [2020-11-30 01:41:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:09,194 INFO L93 Difference]: Finished difference Result 710 states and 1087 transitions. [2020-11-30 01:41:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:09,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-30 01:41:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:09,197 INFO L225 Difference]: With dead ends: 710 [2020-11-30 01:41:09,197 INFO L226 Difference]: Without dead ends: 380 [2020-11-30 01:41:09,198 INFO L677 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 [2020-11-30 01:41:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-11-30 01:41:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 364. [2020-11-30 01:41:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-11-30 01:41:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2020-11-30 01:41:09,218 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 49 [2020-11-30 01:41:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:09,218 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2020-11-30 01:41:09,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2020-11-30 01:41:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-30 01:41:09,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:09,220 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:09,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:41:09,220 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1693285364, now seen corresponding path program 1 times [2020-11-30 01:41:09,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:09,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025029456] [2020-11-30 01:41:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:41:09,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025029456] [2020-11-30 01:41:09,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:09,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:09,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341272018] [2020-11-30 01:41:09,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:09,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:09,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:09,285 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 3 states. [2020-11-30 01:41:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:09,534 INFO L93 Difference]: Finished difference Result 791 states and 1210 transitions. [2020-11-30 01:41:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:09,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-30 01:41:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:09,537 INFO L225 Difference]: With dead ends: 791 [2020-11-30 01:41:09,537 INFO L226 Difference]: Without dead ends: 429 [2020-11-30 01:41:09,538 INFO L677 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 [2020-11-30 01:41:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-11-30 01:41:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-11-30 01:41:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-30 01:41:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 649 transitions. [2020-11-30 01:41:09,563 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 649 transitions. Word has length 49 [2020-11-30 01:41:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:09,563 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 649 transitions. [2020-11-30 01:41:09,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 649 transitions. [2020-11-30 01:41:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-30 01:41:09,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:09,565 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:09,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:41:09,565 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash 676092453, now seen corresponding path program 1 times [2020-11-30 01:41:09,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:09,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532505052] [2020-11-30 01:41:09,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:41:09,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532505052] [2020-11-30 01:41:09,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:09,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:09,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296739262] [2020-11-30 01:41:09,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:09,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:09,617 INFO L87 Difference]: Start difference. First operand 427 states and 649 transitions. Second operand 3 states. [2020-11-30 01:41:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:09,844 INFO L93 Difference]: Finished difference Result 860 states and 1309 transitions. [2020-11-30 01:41:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:09,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-30 01:41:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:09,847 INFO L225 Difference]: With dead ends: 860 [2020-11-30 01:41:09,847 INFO L226 Difference]: Without dead ends: 435 [2020-11-30 01:41:09,849 INFO L677 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 [2020-11-30 01:41:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-11-30 01:41:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 427. [2020-11-30 01:41:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-30 01:41:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 645 transitions. [2020-11-30 01:41:09,870 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 645 transitions. Word has length 61 [2020-11-30 01:41:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:09,870 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 645 transitions. [2020-11-30 01:41:09,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 645 transitions. [2020-11-30 01:41:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-30 01:41:09,872 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:09,872 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:09,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:41:09,872 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 936732041, now seen corresponding path program 1 times [2020-11-30 01:41:09,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:09,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989583123] [2020-11-30 01:41:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:09,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989583123] [2020-11-30 01:41:09,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:09,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:09,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222968230] [2020-11-30 01:41:09,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:09,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:09,936 INFO L87 Difference]: Start difference. First operand 427 states and 645 transitions. Second operand 3 states. [2020-11-30 01:41:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:10,183 INFO L93 Difference]: Finished difference Result 897 states and 1354 transitions. [2020-11-30 01:41:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:10,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-11-30 01:41:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:10,186 INFO L225 Difference]: With dead ends: 897 [2020-11-30 01:41:10,187 INFO L226 Difference]: Without dead ends: 472 [2020-11-30 01:41:10,188 INFO L677 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 [2020-11-30 01:41:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-11-30 01:41:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2020-11-30 01:41:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-11-30 01:41:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 704 transitions. [2020-11-30 01:41:10,210 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 704 transitions. Word has length 72 [2020-11-30 01:41:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:10,211 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 704 transitions. [2020-11-30 01:41:10,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 704 transitions. [2020-11-30 01:41:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-30 01:41:10,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:10,213 INFO L422 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] [2020-11-30 01:41:10,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:41:10,213 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash -715650917, now seen corresponding path program 1 times [2020-11-30 01:41:10,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:10,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118313307] [2020-11-30 01:41:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:41:10,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118313307] [2020-11-30 01:41:10,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:10,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:10,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43513569] [2020-11-30 01:41:10,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:10,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:10,261 INFO L87 Difference]: Start difference. First operand 468 states and 704 transitions. Second operand 3 states. [2020-11-30 01:41:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:10,490 INFO L93 Difference]: Finished difference Result 936 states and 1408 transitions. [2020-11-30 01:41:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:10,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-11-30 01:41:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:10,497 INFO L225 Difference]: With dead ends: 936 [2020-11-30 01:41:10,497 INFO L226 Difference]: Without dead ends: 470 [2020-11-30 01:41:10,498 INFO L677 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 [2020-11-30 01:41:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-11-30 01:41:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2020-11-30 01:41:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-11-30 01:41:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 701 transitions. [2020-11-30 01:41:10,533 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 701 transitions. Word has length 73 [2020-11-30 01:41:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:10,535 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 701 transitions. [2020-11-30 01:41:10,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2020-11-30 01:41:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-30 01:41:10,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:10,536 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:10,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:41:10,537 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:10,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:10,537 INFO L82 PathProgramCache]: Analyzing trace with hash -659279724, now seen corresponding path program 1 times [2020-11-30 01:41:10,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:10,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996241925] [2020-11-30 01:41:10,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 01:41:10,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996241925] [2020-11-30 01:41:10,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:10,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:10,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989858799] [2020-11-30 01:41:10,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:10,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:10,579 INFO L87 Difference]: Start difference. First operand 468 states and 701 transitions. Second operand 3 states. [2020-11-30 01:41:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:10,794 INFO L93 Difference]: Finished difference Result 934 states and 1400 transitions. [2020-11-30 01:41:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:10,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-11-30 01:41:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:10,797 INFO L225 Difference]: With dead ends: 934 [2020-11-30 01:41:10,797 INFO L226 Difference]: Without dead ends: 468 [2020-11-30 01:41:10,799 INFO L677 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 [2020-11-30 01:41:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-11-30 01:41:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2020-11-30 01:41:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-11-30 01:41:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 694 transitions. [2020-11-30 01:41:10,820 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 694 transitions. Word has length 78 [2020-11-30 01:41:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:10,820 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 694 transitions. [2020-11-30 01:41:10,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 694 transitions. [2020-11-30 01:41:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-30 01:41:10,822 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:10,822 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:10,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:41:10,822 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:10,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:10,823 INFO L82 PathProgramCache]: Analyzing trace with hash 360300028, now seen corresponding path program 1 times [2020-11-30 01:41:10,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:10,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170420713] [2020-11-30 01:41:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-30 01:41:10,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170420713] [2020-11-30 01:41:10,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:10,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:10,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742996545] [2020-11-30 01:41:10,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:10,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:10,860 INFO L87 Difference]: Start difference. First operand 466 states and 694 transitions. Second operand 3 states. [2020-11-30 01:41:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:11,068 INFO L93 Difference]: Finished difference Result 980 states and 1462 transitions. [2020-11-30 01:41:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:11,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-11-30 01:41:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:11,072 INFO L225 Difference]: With dead ends: 980 [2020-11-30 01:41:11,072 INFO L226 Difference]: Without dead ends: 516 [2020-11-30 01:41:11,073 INFO L677 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 [2020-11-30 01:41:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-11-30 01:41:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 496. [2020-11-30 01:41:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-11-30 01:41:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 732 transitions. [2020-11-30 01:41:11,096 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 732 transitions. Word has length 85 [2020-11-30 01:41:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:11,097 INFO L481 AbstractCegarLoop]: Abstraction has 496 states and 732 transitions. [2020-11-30 01:41:11,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 732 transitions. [2020-11-30 01:41:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-30 01:41:11,099 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:11,099 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:11,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:41:11,099 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -988219729, now seen corresponding path program 1 times [2020-11-30 01:41:11,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:11,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540159102] [2020-11-30 01:41:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-30 01:41:11,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540159102] [2020-11-30 01:41:11,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:11,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:11,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450100847] [2020-11-30 01:41:11,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:11,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:11,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:11,144 INFO L87 Difference]: Start difference. First operand 496 states and 732 transitions. Second operand 3 states. [2020-11-30 01:41:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:11,347 INFO L93 Difference]: Finished difference Result 1000 states and 1478 transitions. [2020-11-30 01:41:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:11,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-11-30 01:41:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:11,350 INFO L225 Difference]: With dead ends: 1000 [2020-11-30 01:41:11,351 INFO L226 Difference]: Without dead ends: 506 [2020-11-30 01:41:11,352 INFO L677 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 [2020-11-30 01:41:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-11-30 01:41:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 496. [2020-11-30 01:41:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-11-30 01:41:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 726 transitions. [2020-11-30 01:41:11,376 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 726 transitions. Word has length 86 [2020-11-30 01:41:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:11,376 INFO L481 AbstractCegarLoop]: Abstraction has 496 states and 726 transitions. [2020-11-30 01:41:11,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 726 transitions. [2020-11-30 01:41:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-30 01:41:11,378 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:11,378 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:11,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 01:41:11,379 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash -79895851, now seen corresponding path program 1 times [2020-11-30 01:41:11,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:11,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584998399] [2020-11-30 01:41:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 01:41:11,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584998399] [2020-11-30 01:41:11,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:11,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:11,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739914760] [2020-11-30 01:41:11,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:11,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:11,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:11,457 INFO L87 Difference]: Start difference. First operand 496 states and 726 transitions. Second operand 3 states. [2020-11-30 01:41:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:11,717 INFO L93 Difference]: Finished difference Result 1044 states and 1527 transitions. [2020-11-30 01:41:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:11,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-11-30 01:41:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:11,721 INFO L225 Difference]: With dead ends: 1044 [2020-11-30 01:41:11,722 INFO L226 Difference]: Without dead ends: 550 [2020-11-30 01:41:11,723 INFO L677 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 [2020-11-30 01:41:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-11-30 01:41:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2020-11-30 01:41:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-11-30 01:41:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 797 transitions. [2020-11-30 01:41:11,749 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 797 transitions. Word has length 90 [2020-11-30 01:41:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:11,749 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 797 transitions. [2020-11-30 01:41:11,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 797 transitions. [2020-11-30 01:41:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-30 01:41:11,751 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:11,751 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:11,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 01:41:11,752 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1319991481, now seen corresponding path program 1 times [2020-11-30 01:41:11,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:11,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637294808] [2020-11-30 01:41:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 01:41:11,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637294808] [2020-11-30 01:41:11,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:11,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:11,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267071418] [2020-11-30 01:41:11,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:11,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:11,791 INFO L87 Difference]: Start difference. First operand 546 states and 797 transitions. Second operand 3 states. [2020-11-30 01:41:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:12,042 INFO L93 Difference]: Finished difference Result 1093 states and 1595 transitions. [2020-11-30 01:41:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:12,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-11-30 01:41:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:12,046 INFO L225 Difference]: With dead ends: 1093 [2020-11-30 01:41:12,046 INFO L226 Difference]: Without dead ends: 545 [2020-11-30 01:41:12,047 INFO L677 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 [2020-11-30 01:41:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-11-30 01:41:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2020-11-30 01:41:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-11-30 01:41:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 791 transitions. [2020-11-30 01:41:12,073 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 791 transitions. Word has length 91 [2020-11-30 01:41:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:12,074 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 791 transitions. [2020-11-30 01:41:12,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 791 transitions. [2020-11-30 01:41:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-30 01:41:12,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:12,076 INFO L422 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:12,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 01:41:12,076 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1350920032, now seen corresponding path program 1 times [2020-11-30 01:41:12,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:12,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627487731] [2020-11-30 01:41:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-30 01:41:12,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627487731] [2020-11-30 01:41:12,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:12,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:12,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570872368] [2020-11-30 01:41:12,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:12,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:12,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:12,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:12,114 INFO L87 Difference]: Start difference. First operand 543 states and 791 transitions. Second operand 3 states. [2020-11-30 01:41:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:12,329 INFO L93 Difference]: Finished difference Result 1127 states and 1639 transitions. [2020-11-30 01:41:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:12,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-11-30 01:41:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:12,333 INFO L225 Difference]: With dead ends: 1127 [2020-11-30 01:41:12,334 INFO L226 Difference]: Without dead ends: 586 [2020-11-30 01:41:12,335 INFO L677 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 [2020-11-30 01:41:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-11-30 01:41:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2020-11-30 01:41:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-11-30 01:41:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 841 transitions. [2020-11-30 01:41:12,362 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 841 transitions. Word has length 103 [2020-11-30 01:41:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:12,362 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 841 transitions. [2020-11-30 01:41:12,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 841 transitions. [2020-11-30 01:41:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-30 01:41:12,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:12,365 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:41:12,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 01:41:12,365 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1490264082, now seen corresponding path program 1 times [2020-11-30 01:41:12,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:12,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026183855] [2020-11-30 01:41:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-30 01:41:12,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026183855] [2020-11-30 01:41:12,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:12,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:12,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833869595] [2020-11-30 01:41:12,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:12,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:12,409 INFO L87 Difference]: Start difference. First operand 582 states and 841 transitions. Second operand 3 states. [2020-11-30 01:41:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:12,640 INFO L93 Difference]: Finished difference Result 1164 states and 1682 transitions. [2020-11-30 01:41:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:12,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-11-30 01:41:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:12,644 INFO L225 Difference]: With dead ends: 1164 [2020-11-30 01:41:12,644 INFO L226 Difference]: Without dead ends: 584 [2020-11-30 01:41:12,646 INFO L677 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 [2020-11-30 01:41:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-11-30 01:41:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2020-11-30 01:41:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-11-30 01:41:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 836 transitions. [2020-11-30 01:41:12,676 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 836 transitions. Word has length 104 [2020-11-30 01:41:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:12,677 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 836 transitions. [2020-11-30 01:41:12,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 836 transitions. [2020-11-30 01:41:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-30 01:41:12,678 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:12,679 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:12,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 01:41:12,679 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash -478278066, now seen corresponding path program 1 times [2020-11-30 01:41:12,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:12,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718641888] [2020-11-30 01:41:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-11-30 01:41:12,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718641888] [2020-11-30 01:41:12,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:12,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:12,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284609207] [2020-11-30 01:41:12,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:12,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:12,728 INFO L87 Difference]: Start difference. First operand 582 states and 836 transitions. Second operand 3 states. [2020-11-30 01:41:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:12,921 INFO L93 Difference]: Finished difference Result 1198 states and 1720 transitions. [2020-11-30 01:41:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:12,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-11-30 01:41:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:12,926 INFO L225 Difference]: With dead ends: 1198 [2020-11-30 01:41:12,926 INFO L226 Difference]: Without dead ends: 618 [2020-11-30 01:41:12,927 INFO L677 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 [2020-11-30 01:41:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-11-30 01:41:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2020-11-30 01:41:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-11-30 01:41:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 867 transitions. [2020-11-30 01:41:12,965 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 867 transitions. Word has length 106 [2020-11-30 01:41:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:12,966 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 867 transitions. [2020-11-30 01:41:12,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 867 transitions. [2020-11-30 01:41:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-30 01:41:12,968 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:12,968 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:12,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 01:41:12,968 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1420101659, now seen corresponding path program 1 times [2020-11-30 01:41:12,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:12,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708257721] [2020-11-30 01:41:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-11-30 01:41:13,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708257721] [2020-11-30 01:41:13,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:13,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:13,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830940311] [2020-11-30 01:41:13,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:13,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:13,006 INFO L87 Difference]: Start difference. First operand 610 states and 867 transitions. Second operand 3 states. [2020-11-30 01:41:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:13,208 INFO L93 Difference]: Finished difference Result 1222 states and 1737 transitions. [2020-11-30 01:41:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:13,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2020-11-30 01:41:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:13,212 INFO L225 Difference]: With dead ends: 1222 [2020-11-30 01:41:13,213 INFO L226 Difference]: Without dead ends: 614 [2020-11-30 01:41:13,214 INFO L677 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 [2020-11-30 01:41:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-11-30 01:41:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2020-11-30 01:41:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-11-30 01:41:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 858 transitions. [2020-11-30 01:41:13,245 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 858 transitions. Word has length 107 [2020-11-30 01:41:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:13,245 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 858 transitions. [2020-11-30 01:41:13,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 858 transitions. [2020-11-30 01:41:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-11-30 01:41:13,247 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:13,247 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:13,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 01:41:13,248 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1294479363, now seen corresponding path program 1 times [2020-11-30 01:41:13,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:13,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813350506] [2020-11-30 01:41:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-11-30 01:41:13,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813350506] [2020-11-30 01:41:13,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:13,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:13,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750094271] [2020-11-30 01:41:13,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:13,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:13,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:13,288 INFO L87 Difference]: Start difference. First operand 610 states and 858 transitions. Second operand 3 states. [2020-11-30 01:41:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:13,498 INFO L93 Difference]: Finished difference Result 1248 states and 1754 transitions. [2020-11-30 01:41:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:13,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-11-30 01:41:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:13,503 INFO L225 Difference]: With dead ends: 1248 [2020-11-30 01:41:13,503 INFO L226 Difference]: Without dead ends: 640 [2020-11-30 01:41:13,504 INFO L677 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 [2020-11-30 01:41:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-11-30 01:41:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2020-11-30 01:41:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-11-30 01:41:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 884 transitions. [2020-11-30 01:41:13,547 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 884 transitions. Word has length 124 [2020-11-30 01:41:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:13,548 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 884 transitions. [2020-11-30 01:41:13,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 884 transitions. [2020-11-30 01:41:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-11-30 01:41:13,550 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:13,551 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:13,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-30 01:41:13,551 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash 740054320, now seen corresponding path program 1 times [2020-11-30 01:41:13,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:13,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839278493] [2020-11-30 01:41:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-11-30 01:41:13,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839278493] [2020-11-30 01:41:13,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:13,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:13,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819716678] [2020-11-30 01:41:13,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:13,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:13,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:13,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:13,598 INFO L87 Difference]: Start difference. First operand 636 states and 884 transitions. Second operand 3 states. [2020-11-30 01:41:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:13,791 INFO L93 Difference]: Finished difference Result 1272 states and 1768 transitions. [2020-11-30 01:41:13,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:13,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-11-30 01:41:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:13,795 INFO L225 Difference]: With dead ends: 1272 [2020-11-30 01:41:13,795 INFO L226 Difference]: Without dead ends: 638 [2020-11-30 01:41:13,796 INFO L677 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 [2020-11-30 01:41:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-11-30 01:41:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2020-11-30 01:41:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-11-30 01:41:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 874 transitions. [2020-11-30 01:41:13,828 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 874 transitions. Word has length 125 [2020-11-30 01:41:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:13,828 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 874 transitions. [2020-11-30 01:41:13,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 874 transitions. [2020-11-30 01:41:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-30 01:41:13,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:13,831 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:13,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-30 01:41:13,831 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1975086101, now seen corresponding path program 1 times [2020-11-30 01:41:13,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:13,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433978490] [2020-11-30 01:41:13,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-11-30 01:41:13,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433978490] [2020-11-30 01:41:13,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:13,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:13,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571299564] [2020-11-30 01:41:13,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:13,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:13,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:13,908 INFO L87 Difference]: Start difference. First operand 636 states and 874 transitions. Second operand 3 states. [2020-11-30 01:41:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:14,141 INFO L93 Difference]: Finished difference Result 1321 states and 1809 transitions. [2020-11-30 01:41:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:14,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2020-11-30 01:41:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:14,145 INFO L225 Difference]: With dead ends: 1321 [2020-11-30 01:41:14,146 INFO L226 Difference]: Without dead ends: 687 [2020-11-30 01:41:14,147 INFO L677 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 [2020-11-30 01:41:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-11-30 01:41:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2020-11-30 01:41:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2020-11-30 01:41:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 928 transitions. [2020-11-30 01:41:14,181 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 928 transitions. Word has length 129 [2020-11-30 01:41:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:14,181 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 928 transitions. [2020-11-30 01:41:14,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 928 transitions. [2020-11-30 01:41:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-30 01:41:14,183 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:14,184 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:14,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 01:41:14,184 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash -477607933, now seen corresponding path program 1 times [2020-11-30 01:41:14,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:14,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969105824] [2020-11-30 01:41:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-11-30 01:41:14,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969105824] [2020-11-30 01:41:14,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:14,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:14,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646132783] [2020-11-30 01:41:14,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:14,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:14,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:14,238 INFO L87 Difference]: Start difference. First operand 681 states and 928 transitions. Second operand 3 states. [2020-11-30 01:41:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:14,467 INFO L93 Difference]: Finished difference Result 1363 states and 1857 transitions. [2020-11-30 01:41:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:14,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2020-11-30 01:41:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:14,472 INFO L225 Difference]: With dead ends: 1363 [2020-11-30 01:41:14,472 INFO L226 Difference]: Without dead ends: 668 [2020-11-30 01:41:14,474 INFO L677 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 [2020-11-30 01:41:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-11-30 01:41:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 665. [2020-11-30 01:41:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2020-11-30 01:41:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 905 transitions. [2020-11-30 01:41:14,528 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 905 transitions. Word has length 130 [2020-11-30 01:41:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:14,528 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 905 transitions. [2020-11-30 01:41:14,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 905 transitions. [2020-11-30 01:41:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 01:41:14,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:14,530 INFO L422 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, 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] [2020-11-30 01:41:14,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-30 01:41:14,531 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2144292112, now seen corresponding path program 1 times [2020-11-30 01:41:14,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:14,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65065698] [2020-11-30 01:41:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-11-30 01:41:14,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65065698] [2020-11-30 01:41:14,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:14,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:14,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713625113] [2020-11-30 01:41:14,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:14,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:14,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:14,577 INFO L87 Difference]: Start difference. First operand 665 states and 905 transitions. Second operand 3 states. [2020-11-30 01:41:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:14,796 INFO L93 Difference]: Finished difference Result 1332 states and 1813 transitions. [2020-11-30 01:41:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:14,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-11-30 01:41:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:14,800 INFO L225 Difference]: With dead ends: 1332 [2020-11-30 01:41:14,800 INFO L226 Difference]: Without dead ends: 669 [2020-11-30 01:41:14,801 INFO L677 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 [2020-11-30 01:41:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-11-30 01:41:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2020-11-30 01:41:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2020-11-30 01:41:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 898 transitions. [2020-11-30 01:41:14,838 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 898 transitions. Word has length 134 [2020-11-30 01:41:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:14,838 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 898 transitions. [2020-11-30 01:41:14,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 898 transitions. [2020-11-30 01:41:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-30 01:41:14,840 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:14,841 INFO L422 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, 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] [2020-11-30 01:41:14,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-30 01:41:14,841 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1215831198, now seen corresponding path program 1 times [2020-11-30 01:41:14,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:14,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999513934] [2020-11-30 01:41:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-11-30 01:41:14,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999513934] [2020-11-30 01:41:14,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:14,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:41:14,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231573765] [2020-11-30 01:41:14,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:14,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:14,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:14,889 INFO L87 Difference]: Start difference. First operand 665 states and 898 transitions. Second operand 3 states. [2020-11-30 01:41:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:15,106 INFO L93 Difference]: Finished difference Result 1320 states and 1782 transitions. [2020-11-30 01:41:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:15,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2020-11-30 01:41:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:15,110 INFO L225 Difference]: With dead ends: 1320 [2020-11-30 01:41:15,110 INFO L226 Difference]: Without dead ends: 640 [2020-11-30 01:41:15,111 INFO L677 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 [2020-11-30 01:41:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-11-30 01:41:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2020-11-30 01:41:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-11-30 01:41:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 853 transitions. [2020-11-30 01:41:15,147 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 853 transitions. Word has length 135 [2020-11-30 01:41:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:15,147 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 853 transitions. [2020-11-30 01:41:15,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 853 transitions. [2020-11-30 01:41:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-30 01:41:15,149 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:15,150 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:15,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-30 01:41:15,150 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1177983175, now seen corresponding path program 1 times [2020-11-30 01:41:15,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:15,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504813609] [2020-11-30 01:41:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:41:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 01:41:15,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504813609] [2020-11-30 01:41:15,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:41:15,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:41:15,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301763079] [2020-11-30 01:41:15,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:41:15,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 01:41:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:41:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:41:15,215 INFO L87 Difference]: Start difference. First operand 636 states and 853 transitions. Second operand 3 states. [2020-11-30 01:41:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:15,296 INFO L93 Difference]: Finished difference Result 1885 states and 2523 transitions. [2020-11-30 01:41:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:41:15,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2020-11-30 01:41:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:15,304 INFO L225 Difference]: With dead ends: 1885 [2020-11-30 01:41:15,304 INFO L226 Difference]: Without dead ends: 1251 [2020-11-30 01:41:15,306 INFO L677 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 [2020-11-30 01:41:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2020-11-30 01:41:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2020-11-30 01:41:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2020-11-30 01:41:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1668 transitions. [2020-11-30 01:41:15,398 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1668 transitions. Word has length 139 [2020-11-30 01:41:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:15,398 INFO L481 AbstractCegarLoop]: Abstraction has 1249 states and 1668 transitions. [2020-11-30 01:41:15,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:41:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1668 transitions. [2020-11-30 01:41:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-30 01:41:15,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:41:15,401 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:41:15,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 01:41:15,401 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:41:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:41:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1796155715, now seen corresponding path program 1 times [2020-11-30 01:41:15,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:41:15,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762628793] [2020-11-30 01:41:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:41:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:41:15,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:41:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:41:15,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:41:15,612 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 01:41:15,612 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:41:15,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-30 01:41:15,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:41:15 BoogieIcfgContainer [2020-11-30 01:41:15,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:41:15,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:41:15,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:41:15,761 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:41:15,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:41:05" (3/4) ... [2020-11-30 01:41:15,763 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:41:15,907 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e251a5ef-9c6c-4be4-8fba-dcd05e691aed/bin/utaipan/witness.graphml [2020-11-30 01:41:15,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:41:15,909 INFO L168 Benchmark]: Toolchain (without parser) took 12908.62 ms. Allocated memory was 92.3 MB in the beginning and 283.1 MB in the end (delta: 190.8 MB). Free memory was 57.2 MB in the beginning and 184.5 MB in the end (delta: -127.3 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:15,909 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 73.4 MB. Free memory is still 48.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:41:15,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.34 ms. Allocated memory is still 92.3 MB. Free memory was 57.1 MB in the beginning and 41.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:15,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.49 ms. Allocated memory is still 92.3 MB. Free memory was 41.2 MB in the beginning and 38.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:15,911 INFO L168 Benchmark]: Boogie Preprocessor took 61.85 ms. Allocated memory is still 92.3 MB. Free memory was 38.1 MB in the beginning and 70.0 MB in the end (delta: -31.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:15,911 INFO L168 Benchmark]: RCFGBuilder took 1434.09 ms. Allocated memory is still 92.3 MB. Free memory was 69.7 MB in the beginning and 31.5 MB in the end (delta: 38.2 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:15,911 INFO L168 Benchmark]: TraceAbstraction took 10746.99 ms. Allocated memory was 92.3 MB in the beginning and 283.1 MB in the end (delta: 190.8 MB). Free memory was 31.0 MB in the beginning and 202.3 MB in the end (delta: -171.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:15,912 INFO L168 Benchmark]: Witness Printer took 147.04 ms. Allocated memory is still 283.1 MB. Free memory was 201.3 MB in the beginning and 184.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:15,914 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 73.4 MB. Free memory is still 48.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 436.34 ms. Allocated memory is still 92.3 MB. Free memory was 57.1 MB in the beginning and 41.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.49 ms. Allocated memory is still 92.3 MB. Free memory was 41.2 MB in the beginning and 38.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.85 ms. Allocated memory is still 92.3 MB. Free memory was 38.1 MB in the beginning and 70.0 MB in the end (delta: -31.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1434.09 ms. Allocated memory is still 92.3 MB. Free memory was 69.7 MB in the beginning and 31.5 MB in the end (delta: 38.2 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10746.99 ms. Allocated memory was 92.3 MB in the beginning and 283.1 MB in the end (delta: 190.8 MB). Free memory was 31.0 MB in the beginning and 202.3 MB in the end (delta: -171.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. * Witness Printer took 147.04 ms. Allocated memory is still 283.1 MB. Free memory was 201.3 MB in the beginning and 184.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L704] int s ; [L705] int tmp ; [L709] s = 8464 [L14] int s__info_callback = __VERIFIER_nondet_int() ; [L15] int s__in_handshake = __VERIFIER_nondet_int() ; [L16] int s__state ; [L17] int s__new_session ; [L18] int s__server ; [L19] int s__version = __VERIFIER_nondet_int() ; [L20] int s__type ; [L21] int s__init_num ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = 1; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__cert = __VERIFIER_nondet_int() ; [L28] int s__options = __VERIFIER_nondet_int() ; [L29] int s__verify_mode = __VERIFIER_nondet_int() ; [L30] int s__session__peer = __VERIFIER_nondet_int() ; [L31] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L32] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L35] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__cert_request ; [L37] int s__s3__tmp__reuse_message ; [L38] int s__s3__tmp__use_rsa_tmp ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_cipher__algo_strength ; [L43] int s__session__cipher ; [L44] int buf ; [L45] unsigned long l ; [L46] unsigned long Time ; [L47] unsigned long tmp ; [L48] int cb ; [L49] long num1 = __VERIFIER_nondet_long() ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int got_new_session ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 ; [L62] long tmp___8 = __VERIFIER_nondet_long() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int tmp___10 = __VERIFIER_nondet_int() ; [L65] int blastFlag ; [L66] int __cil_tmp55 ; [L67] unsigned long __cil_tmp56 ; [L68] unsigned long __cil_tmp57 ; [L69] unsigned long __cil_tmp58 ; [L70] unsigned long __cil_tmp59 ; [L71] int __cil_tmp60 ; [L72] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L76] s__state = initial_state [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] Time = tmp [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] got_new_session = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND FALSE !(tmp___1 + 12288) [L97] COND FALSE !(s__cert == 0) [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND TRUE s__state == 8464 [L274] s__shutdown = 0 [L275] ret = __VERIFIER_nondet_int() [L276] COND TRUE blastFlag == 0 [L277] blastFlag = 1 [L279] COND FALSE !(ret <= 0) [L282] got_new_session = 1 [L283] s__state = 8496 [L284] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND TRUE s__state == 8496 [L288] ret = __VERIFIER_nondet_int() [L289] COND TRUE blastFlag == 1 [L290] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L295] COND FALSE !(\read(s__hit)) [L298] s__state = 8512 [L300] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND TRUE s__state == 8512 [L305] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L306] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L307] COND TRUE __cil_tmp56 + 256UL [L308] __cil_tmp56 = 256345 [L309] skip = 1 [L320] s__state = 8528 [L321] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND TRUE s__state == 8528 [L325] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L326] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L328] __cil_tmp57 = (unsigned long )s__options [L329] COND TRUE __cil_tmp57 + 2097152UL [L330] s__s3__tmp__use_rsa_tmp = 1 [L335] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L363] ret = __VERIFIER_nondet_int() [L364] COND FALSE !(blastFlag == 3) [L367] COND FALSE !(ret <= 0) [L384] s__state = 8544 [L385] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND TRUE s__state == 8544 [L389] COND TRUE s__verify_mode + 1 [L390] COND TRUE s__session__peer != 0 [L391] COND TRUE s__verify_mode + 4 [L392] s__verify_mode = 123 [L393] skip = 1 [L394] s__s3__tmp__cert_request = 0 [L395] s__state = 8560 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND FALSE !(s__state == 8544) [L158] COND FALSE !(s__state == 8545) [L161] COND TRUE s__state == 8560 [L439] ret = __VERIFIER_nondet_int() [L440] COND FALSE !(ret <= 0) [L443] s__s3__tmp__next_state___0 = 8576 [L444] s__state = 8448 [L445] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND TRUE ! s__s3__tmp__reuse_message [L655] COND TRUE ! skip [L656] COND TRUE state == 8560 [L657] COND TRUE s__state == 8448 [L658] COND TRUE s__verify_mode != -1 [L659] COND TRUE s__verify_mode != -2 [L660] COND TRUE __cil_tmp61 != 9021 [L661] COND TRUE __cil_tmp58 != 4294967294 [L662] COND TRUE blastFlag != 4 [L663] COND TRUE tmp___7 != 1024 [L3] __assert_fail("0", "s3_srvr_12.cil.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.5s, OverallIterations: 33, TraceHistogramMax: 6, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3969 SDtfs, 4395 SDslu, 816 SDs, 0 SdLazy, 2772 SolverSat, 1263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1249occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 198 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2332 ConstructedInterpolants, 0 QuantifiedInterpolants, 394525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 1895/1895 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...