./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/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 4b4145914802a18ceef375a77d9a4f2f13e6c70b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 13:45:49,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 13:45:49,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 13:45:49,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 13:45:49,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 13:45:49,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 13:45:49,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 13:45:49,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 13:45:49,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 13:45:49,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 13:45:49,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 13:45:49,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 13:45:49,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 13:45:49,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 13:45:49,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 13:45:49,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 13:45:49,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 13:45:49,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 13:45:49,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 13:45:49,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 13:45:49,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 13:45:49,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 13:45:49,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 13:45:49,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 13:45:49,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 13:45:49,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 13:45:49,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 13:45:49,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 13:45:49,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 13:45:49,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 13:45:49,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 13:45:49,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 13:45:49,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 13:45:49,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 13:45:49,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 13:45:49,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 13:45:49,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 13:45:49,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 13:45:49,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 13:45:49,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 13:45:49,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 13:45:49,983 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 13:45:50,005 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 13:45:50,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 13:45:50,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 13:45:50,006 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 13:45:50,006 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 13:45:50,007 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 13:45:50,007 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 13:45:50,007 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 13:45:50,007 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 13:45:50,007 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 13:45:50,007 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 13:45:50,008 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 13:45:50,008 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 13:45:50,008 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 13:45:50,008 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 13:45:50,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 13:45:50,009 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 13:45:50,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 13:45:50,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 13:45:50,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 13:45:50,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 13:45:50,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 13:45:50,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 13:45:50,010 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 13:45:50,010 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 13:45:50,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 13:45:50,011 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 13:45:50,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 13:45:50,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 13:45:50,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 13:45:50,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 13:45:50,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 13:45:50,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 13:45:50,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 13:45:50,012 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 13:45:50,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 13:45:50,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 13:45:50,013 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 13:45:50,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 13:45:50,013 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_8791a706-3d93-4d78-a271-b687471f49be/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_8791a706-3d93-4d78-a271-b687471f49be/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 -> 4b4145914802a18ceef375a77d9a4f2f13e6c70b [2020-12-09 13:45:50,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 13:45:50,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 13:45:50,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 13:45:50,241 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 13:45:50,241 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 13:45:50,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2020-12-09 13:45:50,283 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/data/be27c7275/021a9992b5894579816a08f5946f60f3/FLAG838d37594 [2020-12-09 13:45:50,652 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 13:45:50,653 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2020-12-09 13:45:50,660 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/data/be27c7275/021a9992b5894579816a08f5946f60f3/FLAG838d37594 [2020-12-09 13:45:50,669 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/data/be27c7275/021a9992b5894579816a08f5946f60f3 [2020-12-09 13:45:50,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 13:45:50,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 13:45:50,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 13:45:50,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 13:45:50,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 13:45:50,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44909b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50, skipping insertion in model container [2020-12-09 13:45:50,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 13:45:50,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 13:45:50,806 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2020-12-09 13:45:50,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:45:50,850 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 13:45:50,858 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2020-12-09 13:45:50,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 13:45:50,892 INFO L208 MainTranslator]: Completed translation [2020-12-09 13:45:50,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50 WrapperNode [2020-12-09 13:45:50,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 13:45:50,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 13:45:50,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 13:45:50,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 13:45:50,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 13:45:50,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 13:45:50,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 13:45:50,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 13:45:50,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... [2020-12-09 13:45:50,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 13:45:50,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 13:45:50,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 13:45:50,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 13:45:50,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/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-12-09 13:45:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 13:45:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 13:45:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 13:45:51,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 13:45:52,069 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 13:45:52,069 INFO L299 CfgBuilder]: Removed 103 assume(true) statements. [2020-12-09 13:45:52,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:45:52 BoogieIcfgContainer [2020-12-09 13:45:52,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 13:45:52,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 13:45:52,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 13:45:52,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 13:45:52,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:45:50" (1/3) ... [2020-12-09 13:45:52,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e94f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:45:52, skipping insertion in model container [2020-12-09 13:45:52,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:45:50" (2/3) ... [2020-12-09 13:45:52,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e94f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:45:52, skipping insertion in model container [2020-12-09 13:45:52,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:45:52" (3/3) ... [2020-12-09 13:45:52,077 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2020-12-09 13:45:52,087 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 13:45:52,089 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 13:45:52,097 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 13:45:52,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 13:45:52,114 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 13:45:52,114 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 13:45:52,114 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 13:45:52,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 13:45:52,115 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 13:45:52,115 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 13:45:52,115 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 13:45:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-12-09 13:45:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 13:45:52,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:52,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] [2020-12-09 13:45:52,130 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash 714357944, now seen corresponding path program 1 times [2020-12-09 13:45:52,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:52,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302699882] [2020-12-09 13:45:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:52,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302699882] [2020-12-09 13:45:52,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:52,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 13:45:52,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910330437] [2020-12-09 13:45:52,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:52,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:52,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:52,268 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2020-12-09 13:45:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:52,336 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2020-12-09 13:45:52,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:52,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-09 13:45:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:52,349 INFO L225 Difference]: With dead ends: 276 [2020-12-09 13:45:52,349 INFO L226 Difference]: Without dead ends: 174 [2020-12-09 13:45:52,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-12-09 13:45:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-09 13:45:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2020-12-09 13:45:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-12-09 13:45:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2020-12-09 13:45:52,399 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 19 [2020-12-09 13:45:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:52,400 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2020-12-09 13:45:52,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2020-12-09 13:45:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 13:45:52,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:52,401 INFO L422 BasicCegarLoop]: trace histogram [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-12-09 13:45:52,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 13:45:52,402 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash -221768112, now seen corresponding path program 1 times [2020-12-09 13:45:52,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:52,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986821180] [2020-12-09 13:45:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 13:45:52,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986821180] [2020-12-09 13:45:52,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:52,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 13:45:52,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416816640] [2020-12-09 13:45:52,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:52,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:52,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:52,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:52,447 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand 3 states. [2020-12-09 13:45:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:52,504 INFO L93 Difference]: Finished difference Result 444 states and 652 transitions. [2020-12-09 13:45:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:52,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-09 13:45:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:52,507 INFO L225 Difference]: With dead ends: 444 [2020-12-09 13:45:52,507 INFO L226 Difference]: Without dead ends: 285 [2020-12-09 13:45:52,508 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-12-09 13:45:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-12-09 13:45:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2020-12-09 13:45:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-12-09 13:45:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2020-12-09 13:45:52,525 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 36 [2020-12-09 13:45:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:52,525 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2020-12-09 13:45:52,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2020-12-09 13:45:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 13:45:52,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:52,527 INFO L422 BasicCegarLoop]: trace histogram [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-12-09 13:45:52,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 13:45:52,528 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash 697206511, now seen corresponding path program 1 times [2020-12-09 13:45:52,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:52,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132731244] [2020-12-09 13:45:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:52,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132731244] [2020-12-09 13:45:52,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:52,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:52,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318798334] [2020-12-09 13:45:52,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:52,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:52,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:52,585 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand 3 states. [2020-12-09 13:45:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:52,628 INFO L93 Difference]: Finished difference Result 775 states and 1112 transitions. [2020-12-09 13:45:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:52,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-09 13:45:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:52,631 INFO L225 Difference]: With dead ends: 775 [2020-12-09 13:45:52,632 INFO L226 Difference]: Without dead ends: 502 [2020-12-09 13:45:52,633 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-12-09 13:45:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-12-09 13:45:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2020-12-09 13:45:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-12-09 13:45:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 687 transitions. [2020-12-09 13:45:52,655 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 687 transitions. Word has length 36 [2020-12-09 13:45:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:52,656 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 687 transitions. [2020-12-09 13:45:52,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 687 transitions. [2020-12-09 13:45:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 13:45:52,658 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:52,658 INFO L422 BasicCegarLoop]: trace histogram [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-12-09 13:45:52,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 13:45:52,658 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:52,659 INFO L82 PathProgramCache]: Analyzing trace with hash -582118224, now seen corresponding path program 1 times [2020-12-09 13:45:52,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:52,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447072458] [2020-12-09 13:45:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:52,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447072458] [2020-12-09 13:45:52,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:52,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:52,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199318802] [2020-12-09 13:45:52,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:45:52,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:52,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:45:52,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:52,732 INFO L87 Difference]: Start difference. First operand 488 states and 687 transitions. Second operand 4 states. [2020-12-09 13:45:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:52,822 INFO L93 Difference]: Finished difference Result 1354 states and 1918 transitions. [2020-12-09 13:45:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:45:52,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-09 13:45:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:52,829 INFO L225 Difference]: With dead ends: 1354 [2020-12-09 13:45:52,829 INFO L226 Difference]: Without dead ends: 876 [2020-12-09 13:45:52,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2020-12-09 13:45:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 696. [2020-12-09 13:45:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-12-09 13:45:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 981 transitions. [2020-12-09 13:45:52,859 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 981 transitions. Word has length 36 [2020-12-09 13:45:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:52,859 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 981 transitions. [2020-12-09 13:45:52,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:45:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 981 transitions. [2020-12-09 13:45:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-09 13:45:52,862 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:52,862 INFO L422 BasicCegarLoop]: trace histogram [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-12-09 13:45:52,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 13:45:52,862 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:52,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash 635907816, now seen corresponding path program 1 times [2020-12-09 13:45:52,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:52,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794769292] [2020-12-09 13:45:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:52,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794769292] [2020-12-09 13:45:52,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:52,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:52,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349935069] [2020-12-09 13:45:52,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:52,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:52,911 INFO L87 Difference]: Start difference. First operand 696 states and 981 transitions. Second operand 3 states. [2020-12-09 13:45:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:52,954 INFO L93 Difference]: Finished difference Result 1209 states and 1739 transitions. [2020-12-09 13:45:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:52,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-12-09 13:45:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:52,958 INFO L225 Difference]: With dead ends: 1209 [2020-12-09 13:45:52,959 INFO L226 Difference]: Without dead ends: 811 [2020-12-09 13:45:52,959 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-12-09 13:45:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-12-09 13:45:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 761. [2020-12-09 13:45:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2020-12-09 13:45:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1085 transitions. [2020-12-09 13:45:52,982 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1085 transitions. Word has length 37 [2020-12-09 13:45:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:52,982 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 1085 transitions. [2020-12-09 13:45:52,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1085 transitions. [2020-12-09 13:45:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-09 13:45:52,984 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:52,984 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:52,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 13:45:52,985 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash 406497427, now seen corresponding path program 1 times [2020-12-09 13:45:52,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:52,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950206796] [2020-12-09 13:45:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:53,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950206796] [2020-12-09 13:45:53,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:53,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:53,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419026024] [2020-12-09 13:45:53,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:53,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:53,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:53,031 INFO L87 Difference]: Start difference. First operand 761 states and 1085 transitions. Second operand 3 states. [2020-12-09 13:45:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:53,080 INFO L93 Difference]: Finished difference Result 1279 states and 1834 transitions. [2020-12-09 13:45:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:53,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-09 13:45:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:53,084 INFO L225 Difference]: With dead ends: 1279 [2020-12-09 13:45:53,084 INFO L226 Difference]: Without dead ends: 816 [2020-12-09 13:45:53,085 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-12-09 13:45:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-12-09 13:45:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 761. [2020-12-09 13:45:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2020-12-09 13:45:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1050 transitions. [2020-12-09 13:45:53,109 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1050 transitions. Word has length 53 [2020-12-09 13:45:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:53,109 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 1050 transitions. [2020-12-09 13:45:53,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1050 transitions. [2020-12-09 13:45:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-09 13:45:53,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:53,111 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:53,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 13:45:53,111 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1379986386, now seen corresponding path program 1 times [2020-12-09 13:45:53,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:53,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711851618] [2020-12-09 13:45:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:53,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711851618] [2020-12-09 13:45:53,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:53,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:45:53,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090398813] [2020-12-09 13:45:53,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:45:53,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:53,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:45:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:45:53,161 INFO L87 Difference]: Start difference. First operand 761 states and 1050 transitions. Second operand 5 states. [2020-12-09 13:45:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:53,285 INFO L93 Difference]: Finished difference Result 1489 states and 2083 transitions. [2020-12-09 13:45:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 13:45:53,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-09 13:45:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:53,289 INFO L225 Difference]: With dead ends: 1489 [2020-12-09 13:45:53,289 INFO L226 Difference]: Without dead ends: 738 [2020-12-09 13:45:53,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 13:45:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-12-09 13:45:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 716. [2020-12-09 13:45:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-09 13:45:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1001 transitions. [2020-12-09 13:45:53,317 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1001 transitions. Word has length 53 [2020-12-09 13:45:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:53,317 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 1001 transitions. [2020-12-09 13:45:53,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:45:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1001 transitions. [2020-12-09 13:45:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-09 13:45:53,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:53,318 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:53,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 13:45:53,319 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash -119806066, now seen corresponding path program 1 times [2020-12-09 13:45:53,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:53,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777384969] [2020-12-09 13:45:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:53,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777384969] [2020-12-09 13:45:53,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:53,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:45:53,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189493699] [2020-12-09 13:45:53,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:45:53,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:45:53,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:45:53,372 INFO L87 Difference]: Start difference. First operand 716 states and 1001 transitions. Second operand 5 states. [2020-12-09 13:45:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:53,496 INFO L93 Difference]: Finished difference Result 1347 states and 1877 transitions. [2020-12-09 13:45:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:45:53,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-12-09 13:45:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:53,499 INFO L225 Difference]: With dead ends: 1347 [2020-12-09 13:45:53,499 INFO L226 Difference]: Without dead ends: 766 [2020-12-09 13:45:53,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:45:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-12-09 13:45:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 716. [2020-12-09 13:45:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-09 13:45:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 979 transitions. [2020-12-09 13:45:53,526 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 979 transitions. Word has length 55 [2020-12-09 13:45:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:53,527 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 979 transitions. [2020-12-09 13:45:53,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:45:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 979 transitions. [2020-12-09 13:45:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-09 13:45:53,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:53,528 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:53,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 13:45:53,528 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1020545645, now seen corresponding path program 1 times [2020-12-09 13:45:53,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:53,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391005911] [2020-12-09 13:45:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:53,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391005911] [2020-12-09 13:45:53,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:53,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:53,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594457735] [2020-12-09 13:45:53,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:53,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:53,564 INFO L87 Difference]: Start difference. First operand 716 states and 979 transitions. Second operand 3 states. [2020-12-09 13:45:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:53,608 INFO L93 Difference]: Finished difference Result 1302 states and 1779 transitions. [2020-12-09 13:45:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:53,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-12-09 13:45:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:53,612 INFO L225 Difference]: With dead ends: 1302 [2020-12-09 13:45:53,613 INFO L226 Difference]: Without dead ends: 721 [2020-12-09 13:45:53,614 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-12-09 13:45:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-12-09 13:45:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 710. [2020-12-09 13:45:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2020-12-09 13:45:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 927 transitions. [2020-12-09 13:45:53,635 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 927 transitions. Word has length 55 [2020-12-09 13:45:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:53,636 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 927 transitions. [2020-12-09 13:45:53,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 927 transitions. [2020-12-09 13:45:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-09 13:45:53,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:53,637 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:53,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 13:45:53,637 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:53,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1739489372, now seen corresponding path program 1 times [2020-12-09 13:45:53,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:53,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281921238] [2020-12-09 13:45:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:53,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281921238] [2020-12-09 13:45:53,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834929057] [2020-12-09 13:45:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:45:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:53,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 13:45:53,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:45:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 13:45:53,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 13:45:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 13:45:53,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 13:45:53,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [8] total 9 [2020-12-09 13:45:53,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560636296] [2020-12-09 13:45:53,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:53,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:53,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:53,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-09 13:45:53,965 INFO L87 Difference]: Start difference. First operand 710 states and 927 transitions. Second operand 3 states. [2020-12-09 13:45:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:54,039 INFO L93 Difference]: Finished difference Result 1784 states and 2326 transitions. [2020-12-09 13:45:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:54,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-09 13:45:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:54,043 INFO L225 Difference]: With dead ends: 1784 [2020-12-09 13:45:54,044 INFO L226 Difference]: Without dead ends: 1085 [2020-12-09 13:45:54,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-09 13:45:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2020-12-09 13:45:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2020-12-09 13:45:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2020-12-09 13:45:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1385 transitions. [2020-12-09 13:45:54,081 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1385 transitions. Word has length 56 [2020-12-09 13:45:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:54,081 INFO L481 AbstractCegarLoop]: Abstraction has 1083 states and 1385 transitions. [2020-12-09 13:45:54,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1385 transitions. [2020-12-09 13:45:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 13:45:54,083 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:54,083 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:54,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 13:45:54,284 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:54,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 95499498, now seen corresponding path program 1 times [2020-12-09 13:45:54,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:54,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875649157] [2020-12-09 13:45:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:54,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875649157] [2020-12-09 13:45:54,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:54,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:45:54,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559349983] [2020-12-09 13:45:54,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:45:54,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:54,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:45:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:45:54,428 INFO L87 Difference]: Start difference. First operand 1083 states and 1385 transitions. Second operand 5 states. [2020-12-09 13:45:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:54,545 INFO L93 Difference]: Finished difference Result 1829 states and 2348 transitions. [2020-12-09 13:45:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:45:54,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2020-12-09 13:45:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:54,557 INFO L225 Difference]: With dead ends: 1829 [2020-12-09 13:45:54,558 INFO L226 Difference]: Without dead ends: 941 [2020-12-09 13:45:54,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 13:45:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-12-09 13:45:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 923. [2020-12-09 13:45:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-09 13:45:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1196 transitions. [2020-12-09 13:45:54,589 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1196 transitions. Word has length 57 [2020-12-09 13:45:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:54,590 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1196 transitions. [2020-12-09 13:45:54,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:45:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1196 transitions. [2020-12-09 13:45:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-09 13:45:54,591 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:54,591 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:54,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 13:45:54,592 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1090490428, now seen corresponding path program 1 times [2020-12-09 13:45:54,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:54,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315212892] [2020-12-09 13:45:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:54,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315212892] [2020-12-09 13:45:54,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684938736] [2020-12-09 13:45:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:45:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:54,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 13:45:54,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:45:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 13:45:54,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 13:45:54,811 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 13:45:54,811 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 13:45:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 13:45:54,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 13:45:54,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [8] total 10 [2020-12-09 13:45:54,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330964296] [2020-12-09 13:45:54,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:45:54,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:45:54,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 13:45:54,851 INFO L87 Difference]: Start difference. First operand 923 states and 1196 transitions. Second operand 4 states. [2020-12-09 13:45:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:54,931 INFO L93 Difference]: Finished difference Result 1523 states and 1978 transitions. [2020-12-09 13:45:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:45:54,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-09 13:45:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:54,936 INFO L225 Difference]: With dead ends: 1523 [2020-12-09 13:45:54,936 INFO L226 Difference]: Without dead ends: 949 [2020-12-09 13:45:54,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 13:45:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2020-12-09 13:45:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 923. [2020-12-09 13:45:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-09 13:45:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1175 transitions. [2020-12-09 13:45:54,980 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1175 transitions. Word has length 59 [2020-12-09 13:45:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:54,980 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1175 transitions. [2020-12-09 13:45:54,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:45:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1175 transitions. [2020-12-09 13:45:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-09 13:45:54,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:54,982 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:55,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-09 13:45:55,183 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -792475474, now seen corresponding path program 1 times [2020-12-09 13:45:55,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:55,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032764965] [2020-12-09 13:45:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:55,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032764965] [2020-12-09 13:45:55,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448358234] [2020-12-09 13:45:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:45:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:55,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 13:45:55,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:45:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:55,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 13:45:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:55,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 13:45:55,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 13:45:55,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219435992] [2020-12-09 13:45:55,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:45:55,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:55,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:45:55,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:45:55,336 INFO L87 Difference]: Start difference. First operand 923 states and 1175 transitions. Second operand 4 states. [2020-12-09 13:45:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:55,394 INFO L93 Difference]: Finished difference Result 1790 states and 2282 transitions. [2020-12-09 13:45:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:45:55,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-09 13:45:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:55,399 INFO L225 Difference]: With dead ends: 1790 [2020-12-09 13:45:55,399 INFO L226 Difference]: Without dead ends: 1026 [2020-12-09 13:45:55,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:45:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2020-12-09 13:45:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 916. [2020-12-09 13:45:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2020-12-09 13:45:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1165 transitions. [2020-12-09 13:45:55,444 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1165 transitions. Word has length 59 [2020-12-09 13:45:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:55,445 INFO L481 AbstractCegarLoop]: Abstraction has 916 states and 1165 transitions. [2020-12-09 13:45:55,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:45:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1165 transitions. [2020-12-09 13:45:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-09 13:45:55,446 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:55,446 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:55,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-09 13:45:55,647 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1944592015, now seen corresponding path program 1 times [2020-12-09 13:45:55,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:55,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700868582] [2020-12-09 13:45:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-09 13:45:55,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700868582] [2020-12-09 13:45:55,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:55,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:55,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264620644] [2020-12-09 13:45:55,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:45:55,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:45:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:55,673 INFO L87 Difference]: Start difference. First operand 916 states and 1165 transitions. Second operand 4 states. [2020-12-09 13:45:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:55,759 INFO L93 Difference]: Finished difference Result 2192 states and 2811 transitions. [2020-12-09 13:45:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:45:55,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-09 13:45:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:55,764 INFO L225 Difference]: With dead ends: 2192 [2020-12-09 13:45:55,765 INFO L226 Difference]: Without dead ends: 1287 [2020-12-09 13:45:55,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2020-12-09 13:45:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1161. [2020-12-09 13:45:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2020-12-09 13:45:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1445 transitions. [2020-12-09 13:45:55,808 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1445 transitions. Word has length 59 [2020-12-09 13:45:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:55,809 INFO L481 AbstractCegarLoop]: Abstraction has 1161 states and 1445 transitions. [2020-12-09 13:45:55,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:45:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1445 transitions. [2020-12-09 13:45:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-09 13:45:55,810 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:55,811 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:55,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 13:45:55,811 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1511297364, now seen corresponding path program 1 times [2020-12-09 13:45:55,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:55,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129104517] [2020-12-09 13:45:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:55,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129104517] [2020-12-09 13:45:55,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:55,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:55,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255814475] [2020-12-09 13:45:55,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:55,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:55,838 INFO L87 Difference]: Start difference. First operand 1161 states and 1445 transitions. Second operand 3 states. [2020-12-09 13:45:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:55,880 INFO L93 Difference]: Finished difference Result 1747 states and 2196 transitions. [2020-12-09 13:45:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:55,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-12-09 13:45:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:55,884 INFO L225 Difference]: With dead ends: 1747 [2020-12-09 13:45:55,884 INFO L226 Difference]: Without dead ends: 789 [2020-12-09 13:45:55,885 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-12-09 13:45:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-12-09 13:45:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 777. [2020-12-09 13:45:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-12-09 13:45:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 941 transitions. [2020-12-09 13:45:55,924 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 941 transitions. Word has length 60 [2020-12-09 13:45:55,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:55,924 INFO L481 AbstractCegarLoop]: Abstraction has 777 states and 941 transitions. [2020-12-09 13:45:55,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 941 transitions. [2020-12-09 13:45:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-09 13:45:55,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:55,925 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:55,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 13:45:55,926 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:55,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:55,926 INFO L82 PathProgramCache]: Analyzing trace with hash -223102835, now seen corresponding path program 1 times [2020-12-09 13:45:55,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:55,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520706769] [2020-12-09 13:45:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 13:45:55,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520706769] [2020-12-09 13:45:55,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:55,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 13:45:55,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402597152] [2020-12-09 13:45:55,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:55,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:55,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:55,958 INFO L87 Difference]: Start difference. First operand 777 states and 941 transitions. Second operand 3 states. [2020-12-09 13:45:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:55,999 INFO L93 Difference]: Finished difference Result 1328 states and 1611 transitions. [2020-12-09 13:45:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:55,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-12-09 13:45:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:56,002 INFO L225 Difference]: With dead ends: 1328 [2020-12-09 13:45:56,002 INFO L226 Difference]: Without dead ends: 777 [2020-12-09 13:45:56,003 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-12-09 13:45:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2020-12-09 13:45:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2020-12-09 13:45:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-12-09 13:45:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 923 transitions. [2020-12-09 13:45:56,031 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 923 transitions. Word has length 60 [2020-12-09 13:45:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:56,031 INFO L481 AbstractCegarLoop]: Abstraction has 777 states and 923 transitions. [2020-12-09 13:45:56,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 923 transitions. [2020-12-09 13:45:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-09 13:45:56,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:56,033 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:56,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 13:45:56,033 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1399669982, now seen corresponding path program 1 times [2020-12-09 13:45:56,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:56,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515067461] [2020-12-09 13:45:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 13:45:56,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515067461] [2020-12-09 13:45:56,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:56,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 13:45:56,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849605017] [2020-12-09 13:45:56,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 13:45:56,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 13:45:56,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 13:45:56,089 INFO L87 Difference]: Start difference. First operand 777 states and 923 transitions. Second operand 6 states. [2020-12-09 13:45:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:56,258 INFO L93 Difference]: Finished difference Result 1508 states and 1790 transitions. [2020-12-09 13:45:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 13:45:56,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-12-09 13:45:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:56,263 INFO L225 Difference]: With dead ends: 1508 [2020-12-09 13:45:56,263 INFO L226 Difference]: Without dead ends: 775 [2020-12-09 13:45:56,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-09 13:45:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-12-09 13:45:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 651. [2020-12-09 13:45:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2020-12-09 13:45:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 760 transitions. [2020-12-09 13:45:56,302 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 760 transitions. Word has length 61 [2020-12-09 13:45:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:56,303 INFO L481 AbstractCegarLoop]: Abstraction has 651 states and 760 transitions. [2020-12-09 13:45:56,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 13:45:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 760 transitions. [2020-12-09 13:45:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-09 13:45:56,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:56,305 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:56,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 13:45:56,305 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:56,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1284992014, now seen corresponding path program 1 times [2020-12-09 13:45:56,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:56,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22808074] [2020-12-09 13:45:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:56,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22808074] [2020-12-09 13:45:56,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:56,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:45:56,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288711892] [2020-12-09 13:45:56,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:45:56,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:45:56,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:56,342 INFO L87 Difference]: Start difference. First operand 651 states and 760 transitions. Second operand 4 states. [2020-12-09 13:45:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:56,435 INFO L93 Difference]: Finished difference Result 1335 states and 1549 transitions. [2020-12-09 13:45:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:45:56,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-09 13:45:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:56,439 INFO L225 Difference]: With dead ends: 1335 [2020-12-09 13:45:56,439 INFO L226 Difference]: Without dead ends: 828 [2020-12-09 13:45:56,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-12-09 13:45:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 704. [2020-12-09 13:45:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-12-09 13:45:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 811 transitions. [2020-12-09 13:45:56,477 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 811 transitions. Word has length 62 [2020-12-09 13:45:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:56,477 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 811 transitions. [2020-12-09 13:45:56,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:45:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 811 transitions. [2020-12-09 13:45:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-09 13:45:56,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:56,479 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:56,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 13:45:56,480 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:56,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:56,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1948743309, now seen corresponding path program 1 times [2020-12-09 13:45:56,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:56,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820335548] [2020-12-09 13:45:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:56,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820335548] [2020-12-09 13:45:56,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270105889] [2020-12-09 13:45:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:45:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:56,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 13:45:56,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 13:45:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:56,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 13:45:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 13:45:56,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 13:45:56,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2020-12-09 13:45:56,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340939675] [2020-12-09 13:45:56,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:45:56,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:56,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:45:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:45:56,672 INFO L87 Difference]: Start difference. First operand 704 states and 811 transitions. Second operand 4 states. [2020-12-09 13:45:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:56,718 INFO L93 Difference]: Finished difference Result 1164 states and 1337 transitions. [2020-12-09 13:45:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:45:56,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-09 13:45:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:56,720 INFO L225 Difference]: With dead ends: 1164 [2020-12-09 13:45:56,720 INFO L226 Difference]: Without dead ends: 536 [2020-12-09 13:45:56,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:45:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-12-09 13:45:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 487. [2020-12-09 13:45:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-12-09 13:45:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 556 transitions. [2020-12-09 13:45:56,740 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 556 transitions. Word has length 77 [2020-12-09 13:45:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:56,740 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 556 transitions. [2020-12-09 13:45:56,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:45:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 556 transitions. [2020-12-09 13:45:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-09 13:45:56,741 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:56,741 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 13:45:56,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 13:45:56,942 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:56,942 INFO L82 PathProgramCache]: Analyzing trace with hash -798186320, now seen corresponding path program 1 times [2020-12-09 13:45:56,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:56,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005253164] [2020-12-09 13:45:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 13:45:57,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005253164] [2020-12-09 13:45:57,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:57,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:45:57,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887642971] [2020-12-09 13:45:57,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:45:57,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:45:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:45:57,019 INFO L87 Difference]: Start difference. First operand 487 states and 556 transitions. Second operand 5 states. [2020-12-09 13:45:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:57,104 INFO L93 Difference]: Finished difference Result 1453 states and 1653 transitions. [2020-12-09 13:45:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 13:45:57,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2020-12-09 13:45:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:57,108 INFO L225 Difference]: With dead ends: 1453 [2020-12-09 13:45:57,108 INFO L226 Difference]: Without dead ends: 1113 [2020-12-09 13:45:57,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:45:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-12-09 13:45:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 848. [2020-12-09 13:45:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2020-12-09 13:45:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 973 transitions. [2020-12-09 13:45:57,178 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 973 transitions. Word has length 79 [2020-12-09 13:45:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:57,178 INFO L481 AbstractCegarLoop]: Abstraction has 848 states and 973 transitions. [2020-12-09 13:45:57,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:45:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 973 transitions. [2020-12-09 13:45:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-09 13:45:57,180 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:57,181 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:57,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 13:45:57,181 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash -203131225, now seen corresponding path program 1 times [2020-12-09 13:45:57,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:57,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190664423] [2020-12-09 13:45:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-12-09 13:45:57,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190664423] [2020-12-09 13:45:57,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:57,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 13:45:57,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713976879] [2020-12-09 13:45:57,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 13:45:57,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:57,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 13:45:57,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 13:45:57,236 INFO L87 Difference]: Start difference. First operand 848 states and 973 transitions. Second operand 5 states. [2020-12-09 13:45:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:57,330 INFO L93 Difference]: Finished difference Result 1299 states and 1484 transitions. [2020-12-09 13:45:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 13:45:57,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2020-12-09 13:45:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:57,333 INFO L225 Difference]: With dead ends: 1299 [2020-12-09 13:45:57,333 INFO L226 Difference]: Without dead ends: 615 [2020-12-09 13:45:57,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 13:45:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-12-09 13:45:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 584. [2020-12-09 13:45:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-12-09 13:45:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 666 transitions. [2020-12-09 13:45:57,361 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 666 transitions. Word has length 100 [2020-12-09 13:45:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:57,361 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 666 transitions. [2020-12-09 13:45:57,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 13:45:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 666 transitions. [2020-12-09 13:45:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-09 13:45:57,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:57,362 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:57,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-09 13:45:57,362 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:57,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1486546352, now seen corresponding path program 1 times [2020-12-09 13:45:57,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:57,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960012385] [2020-12-09 13:45:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-09 13:45:57,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960012385] [2020-12-09 13:45:57,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:57,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 13:45:57,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641783639] [2020-12-09 13:45:57,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 13:45:57,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:57,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 13:45:57,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 13:45:57,397 INFO L87 Difference]: Start difference. First operand 584 states and 666 transitions. Second operand 3 states. [2020-12-09 13:45:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:57,444 INFO L93 Difference]: Finished difference Result 982 states and 1117 transitions. [2020-12-09 13:45:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 13:45:57,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-09 13:45:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:57,447 INFO L225 Difference]: With dead ends: 982 [2020-12-09 13:45:57,447 INFO L226 Difference]: Without dead ends: 562 [2020-12-09 13:45:57,448 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-12-09 13:45:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-12-09 13:45:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 550. [2020-12-09 13:45:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-12-09 13:45:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 625 transitions. [2020-12-09 13:45:57,473 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 625 transitions. Word has length 101 [2020-12-09 13:45:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:57,473 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 625 transitions. [2020-12-09 13:45:57,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 13:45:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 625 transitions. [2020-12-09 13:45:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-09 13:45:57,474 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 13:45:57,474 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 13:45:57,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-09 13:45:57,474 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 13:45:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 13:45:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2048088721, now seen corresponding path program 1 times [2020-12-09 13:45:57,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 13:45:57,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085363181] [2020-12-09 13:45:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 13:45:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 13:45:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 13:45:57,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085363181] [2020-12-09 13:45:57,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 13:45:57,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 13:45:57,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593279405] [2020-12-09 13:45:57,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 13:45:57,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 13:45:57,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 13:45:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:57,517 INFO L87 Difference]: Start difference. First operand 550 states and 625 transitions. Second operand 4 states. [2020-12-09 13:45:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 13:45:57,581 INFO L93 Difference]: Finished difference Result 793 states and 891 transitions. [2020-12-09 13:45:57,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 13:45:57,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-09 13:45:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 13:45:57,582 INFO L225 Difference]: With dead ends: 793 [2020-12-09 13:45:57,582 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 13:45:57,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 13:45:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 13:45:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 13:45:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 13:45:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 13:45:57,583 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2020-12-09 13:45:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 13:45:57,583 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 13:45:57,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 13:45:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 13:45:57,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 13:45:57,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-09 13:45:57,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 13:45:58,617 WARN L197 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2020-12-09 13:45:58,773 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-12-09 13:45:59,098 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-12-09 13:45:59,331 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-12-09 13:45:59,463 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-12-09 13:45:59,674 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-12-09 13:46:00,291 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-12-09 13:46:00,483 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-12-09 13:46:01,044 WARN L197 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2020-12-09 13:46:01,311 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-09 13:46:01,706 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-09 13:46:01,741 INFO L258 CegarLoopResult]: At program point L564(lines 564 573) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,741 INFO L258 CegarLoopResult]: At program point L564-1(lines 564 573) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,741 INFO L262 CegarLoopResult]: For program point L300(lines 300 307) no Hoare annotation was computed. [2020-12-09 13:46:01,742 INFO L258 CegarLoopResult]: At program point L169(lines 157 171) the Hoare annotation is: (and (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= 0 ~t2_st~0) (<= ~t1_pc~0 0) (<= ~token~0 ~local~0) (<= ~m_pc~0 0) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= 0 ~t2_pc~0) (= ~E_1~0 2) (<= 2 ~E_M~0)) [2020-12-09 13:46:01,742 INFO L258 CegarLoopResult]: At program point L169-1(lines 157 171) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse13 (= 0 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse0 (= 2 ~t2_st~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse9 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse10 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse12 .cse3 .cse14 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10))) [2020-12-09 13:46:01,742 INFO L258 CegarLoopResult]: At program point L169-2(lines 157 171) the Hoare annotation is: (let ((.cse13 (+ ~local~0 1))) (let ((.cse4 (= ~t2_pc~0 1)) (.cse0 (<= ~token~0 .cse13)) (.cse1 (< 0 ~t1_st~0)) (.cse2 (= ~E_1~0 2)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (<= .cse13 ~token~0)) (.cse6 (= ~t1_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ~t2_st~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (= 0 ~t2_pc~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse11)))) [2020-12-09 13:46:01,742 INFO L258 CegarLoopResult]: At program point L169-3(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (= 2 ~t1_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (or (= ~E_M~0 1) (<= 2 ~E_M~0))) (.cse5 (< 0 ~t2_st~0)) (.cse6 (= ~E_1~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ~token~0 (+ ~local~0 2)) .cse0 .cse1 (< (+ ~local~0 1) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,742 INFO L258 CegarLoopResult]: At program point L169-4(lines 157 171) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~E_1~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8))) [2020-12-09 13:46:01,743 INFO L258 CegarLoopResult]: At program point L169-5(lines 157 171) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,743 INFO L258 CegarLoopResult]: At program point L207(lines 195 209) the Hoare annotation is: (and (<= 2 ~E_2~0) (<= ~t1_pc~0 0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= 0 ~t2_pc~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~m_pc~0 0) (<= ~local~0 ~token~0) (<= 2 ~E_M~0)) [2020-12-09 13:46:01,743 INFO L258 CegarLoopResult]: At program point L207-1(lines 195 209) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse6 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse10 (= ~t2_pc~0 1)) (.cse0 (= 2 ~t2_st~0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse11 (= 0 ~t2_st~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse12 (= 0 ~t2_pc~0)) (.cse9 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse7 .cse12 .cse9 .cse8) (and .cse3 .cse13 .cse4 .cse6 .cse9 .cse10 .cse0 .cse14 .cse2 .cse15 .cse5 .cse7 .cse8) (and .cse14 .cse2 .cse15 .cse3 .cse11 .cse13 .cse4 .cse5 .cse12 .cse9 .cse7 .cse8))) [2020-12-09 13:46:01,743 INFO L258 CegarLoopResult]: At program point L207-2(lines 195 209) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse4 (= ~E_2~0 1)) (.cse0 (<= ~token~0 .cse12)) (.cse1 (<= .cse12 ~token~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (= ~m_pc~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~E_1~0 2)) (.cse10 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) .cse7 .cse8 .cse9 .cse10) (and .cse4 (let ((.cse11 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse7 .cse9 .cse8 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11))))))) [2020-12-09 13:46:01,743 INFO L258 CegarLoopResult]: At program point L207-3(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (or (= ~E_M~0 1) (<= 2 ~E_M~0))) (.cse6 (< 0 ~t2_st~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9) (and (<= ~token~0 (+ ~local~0 2)) .cse0 .cse1 .cse2 (< (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,743 INFO L258 CegarLoopResult]: At program point L207-4(lines 195 209) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ~E_1~0 2)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,743 INFO L262 CegarLoopResult]: For program point L42(lines 42 50) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L258 CegarLoopResult]: At program point L207-5(lines 195 209) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-2(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-3(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-5(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-6(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-8(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-9(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-11(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,744 INFO L262 CegarLoopResult]: For program point L177-12(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L177-14(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L177-15(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L177-17(lines 177 186) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L178(lines 178 183) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L178-1(lines 178 183) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L178-2(lines 178 183) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L178-3(lines 178 183) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L258 CegarLoopResult]: At program point L46(lines 41 80) the Hoare annotation is: (and (<= ~token~0 (+ ~local~0 2)) (<= 2 ~E_2~0) (< (+ ~local~0 1) ~token~0) (= 2 ~t1_st~0) (not (= ~m_st~0 0)) (= ~E_1~0 2) (= ~t2_pc~0 1) (= 2 ~t2_st~0) (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 1) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= 2 ~E_M~0)) [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L178-4(lines 178 183) no Hoare annotation was computed. [2020-12-09 13:46:01,745 INFO L262 CegarLoopResult]: For program point L178-5(lines 178 183) no Hoare annotation was computed. [2020-12-09 13:46:01,746 INFO L258 CegarLoopResult]: At program point L311(lines 273 325) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse22 (+ ~local~0 1))) (let ((.cse5 (= 0 ~t2_pc~0)) (.cse17 (<= ~token~0 .cse22)) (.cse19 (<= .cse22 ~token~0)) (.cse8 (= 0 ~t2_st~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse9 (<= ~m_pc~0 0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse18 (not .cse3)) (.cse21 (= 2 ~t2_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (<= 2 ~E_2~0)) (.cse1 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 1)) (.cse4 (= ~E_1~0 2)) (.cse12 (<= 2 ~E_M~0)) (.cse20 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse13 .cse2 .cse5 .cse14 .cse7 .cse15 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse8 .cse16 .cse10 .cse11 .cse12) (and .cse17 .cse0 .cse1 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse16 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse18 .cse4 .cse20 .cse21 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse21 .cse6 .cse0 .cse1 .cse16 .cse4 .cse18 .cse12 .cse20) (and .cse21 .cse6 .cse7 .cse0 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse12 .cse20) (and .cse6 .cse7 .cse0 .cse8 .cse2 .cse16 .cse10 .cse18 .cse4 .cse5 .cse11 .cse12) (and .cse17 .cse0 .cse1 .cse18 .cse4 .cse20 .cse19 .cse6 .cse7 .cse8 .cse16 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse20 .cse21 .cse14 .cse7 .cse15 .cse9 .cse10 .cse11 .cse12) (and .cse21 .cse6 .cse0 .cse16 .cse2 .cse10 .cse4 .cse18 .cse12 .cse20) (and (<= ~token~0 (+ ~local~0 2)) .cse21 .cse6 .cse14 .cse0 (< .cse22 ~token~0) .cse1 .cse16 .cse4 .cse12 .cse20)))) [2020-12-09 13:46:01,746 INFO L262 CegarLoopResult]: For program point L278(lines 278 282) no Hoare annotation was computed. [2020-12-09 13:46:01,746 INFO L262 CegarLoopResult]: For program point L278-1(lines 273 325) no Hoare annotation was computed. [2020-12-09 13:46:01,746 INFO L262 CegarLoopResult]: For program point L577(lines 577 581) no Hoare annotation was computed. [2020-12-09 13:46:01,746 INFO L258 CegarLoopResult]: At program point L545-1(lines 370 582) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0))) (let ((.cse1 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 2 ~t2_st~0)) (.cse9 (= ~t1_pc~0 1)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (<= 2 ~E_2~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse12 (not .cse2)) (.cse3 (= ~E_1~0 2)) (.cse7 (<= 2 ~E_M~0)) (.cse13 (= ~t2_pc~0 1))) (or (and .cse0 (<= ~t1_pc~0 0) .cse1 .cse2 (= 0 ~t2_pc~0) .cse3 .cse4 .cse5 (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~m_pc~0 0) .cse6 .cse7) (and .cse8 .cse9 .cse5 .cse0 .cse1 .cse10 .cse6 .cse11 .cse12 .cse3 .cse7 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse0 (= 2 ~t1_st~0) .cse10 .cse11 .cse12 .cse3 .cse7 .cse13)))) [2020-12-09 13:46:01,746 INFO L262 CegarLoopResult]: For program point L314(lines 314 321) no Hoare annotation was computed. [2020-12-09 13:46:01,746 INFO L258 CegarLoopResult]: At program point L283(lines 273 325) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse17 (+ ~local~0 1))) (let ((.cse4 (= 0 ~t2_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= ~t1_st~0 0)) (.cse9 (<= ~m_pc~0 0)) (.cse20 (<= ~token~0 .cse17)) (.cse22 (<= .cse17 ~token~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= 0 ~t2_st~0)) (.cse1 (= 2 ~t1_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_2~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse21 (not .cse3)) (.cse5 (= ~E_1~0 2)) (.cse12 (<= 2 ~E_M~0)) (.cse19 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~token~0 (+ ~local~0 2)) .cse16 .cse6 .cse14 (< .cse17 ~token~0) .cse0 .cse1 .cse18 .cse11 .cse5 .cse12 .cse19) (and .cse0 .cse13 .cse2 .cse4 .cse14 .cse7 .cse15 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse8 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse19 .cse16 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse5 .cse4 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse21 .cse5 .cse19 .cse16 .cse14 .cse15 .cse18 .cse10 .cse11 .cse12) (and .cse6 .cse7 .cse0 .cse8 .cse2 .cse18 .cse10 .cse21 .cse5 .cse4 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse5 .cse19 .cse16 .cse14 .cse7 .cse15 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse5 .cse19 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse16 .cse6 .cse0 .cse1 .cse18 .cse11 .cse21 .cse5 .cse12 .cse19) (and .cse16 .cse6 .cse0 .cse2 .cse18 .cse10 .cse11 .cse21 .cse5 .cse12 .cse19)))) [2020-12-09 13:46:01,746 INFO L265 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-12-09 13:46:01,746 INFO L262 CegarLoopResult]: For program point L86(lines 86 94) no Hoare annotation was computed. [2020-12-09 13:46:01,747 INFO L265 CegarLoopResult]: At program point L583(lines 530 588) the Hoare annotation is: true [2020-12-09 13:46:01,747 INFO L262 CegarLoopResult]: For program point L286(lines 286 293) no Hoare annotation was computed. [2020-12-09 13:46:01,747 INFO L258 CegarLoopResult]: At program point L188(lines 176 190) the Hoare annotation is: (and (<= 2 ~E_2~0) (<= ~t1_pc~0 0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (= 0 ~t2_pc~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~m_pc~0 0) (<= ~local~0 ~token~0) (<= 2 ~E_M~0)) [2020-12-09 13:46:01,747 INFO L258 CegarLoopResult]: At program point L188-1(lines 176 190) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse13 (= 0 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse15 (= 0 ~t2_pc~0)) (.cse0 (= 2 ~t2_st~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse9 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse10 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse15 .cse9 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse12 .cse3 .cse14 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10))) [2020-12-09 13:46:01,747 INFO L258 CegarLoopResult]: At program point L188-2(lines 176 190) the Hoare annotation is: (let ((.cse13 (+ ~local~0 1))) (let ((.cse0 (<= ~token~0 .cse13)) (.cse1 (< 0 ~t1_st~0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse4 (<= .cse13 ~token~0)) (.cse5 (= ~t1_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 1)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (= 0 ~t2_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 (= 2 ~t2_st~0) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2020-12-09 13:46:01,747 INFO L262 CegarLoopResult]: For program point L122(lines 122 130) no Hoare annotation was computed. [2020-12-09 13:46:01,747 INFO L258 CegarLoopResult]: At program point L89(lines 89 93) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 0))) (let ((.cse3 (<= ~t1_pc~0 0)) (.cse12 (= 0 ~t2_pc~0)) (.cse17 (<= ~m_pc~0 0)) (.cse0 (= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (< 0 ~t1_st~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse9 (= ~E_1~0 2)) (.cse8 (not .cse16)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse4 (= ~m_pc~0 1)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse5 .cse9 .cse12 .cse8 .cse13 .cse14 .cse15 .cse4 .cse6 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse14 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse15 .cse4 .cse6 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse16 .cse9 .cse11 .cse0 .cse14 .cse17 .cse6 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse16 .cse12 .cse9 .cse14 .cse15 .cse17 .cse6 .cse7 .cse10) (and .cse0 .cse13 .cse1 .cse2 .cse5 .cse4 .cse6 .cse9 .cse7 .cse10 .cse8 .cse11) (and .cse1 .cse2 .cse5 .cse9 .cse8 .cse11 .cse13 .cse14 .cse15 .cse4 .cse6 .cse7 .cse10)))) [2020-12-09 13:46:01,748 INFO L258 CegarLoopResult]: At program point L188-3(lines 176 190) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (or (= ~E_M~0 1) (<= 2 ~E_M~0))) (.cse6 (< 0 ~t2_st~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9) (and (<= ~token~0 (+ ~local~0 2)) .cse0 .cse1 .cse2 (< (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,748 INFO L258 CegarLoopResult]: At program point L188-4(lines 176 190) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ~E_1~0 2)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8))) [2020-12-09 13:46:01,748 INFO L258 CegarLoopResult]: At program point L188-5(lines 176 190) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point L158(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,748 INFO L258 CegarLoopResult]: At program point L125(lines 125 129) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) (<= 2 ~E_2~0) (= 2 ~t1_st~0) (= ~E_1~0 2) (not (= ~m_st~0 0)) (= ~t2_pc~0 1) (<= .cse0 ~token~0) (= ~t1_pc~0 1) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 1) (< 0 ~t2_st~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (<= 2 ~E_M~0))) [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point L158-2(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point L158-3(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point L158-5(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point L158-6(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point L158-8(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,748 INFO L262 CegarLoopResult]: For program point L158-9(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L158-11(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L158-12(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L158-14(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L158-15(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L158-17(lines 158 167) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L159(lines 159 164) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L159-1(lines 159 164) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L159-4(lines 159 164) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L258 CegarLoopResult]: At program point L326(lines 267 331) the Hoare annotation is: (let ((.cse0 (= 2 ~t2_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_2~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~E_1~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= 2 ~t1_st~0) .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L196(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,749 INFO L262 CegarLoopResult]: For program point L196-2(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-3(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L258 CegarLoopResult]: At program point L97-1(lines 85 116) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 0))) (let ((.cse19 (+ ~local~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (<= 2 ~E_2~0)) (.cse17 (= ~m_pc~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse18 (not .cse6)) (.cse8 (= ~E_1~0 2)) (.cse10 (<= 2 ~E_M~0))) (let ((.cse3 (< 0 ~t1_st~0)) (.cse4 (<= ~m_pc~0 0)) (.cse0 (= 2 ~t2_st~0)) (.cse5 (<= ~token~0 ~local~0)) (.cse16 (or (and .cse1 (= ~m_st~0 ~E_1~0) .cse2 .cse17 .cse9 .cse8 .cse10) (and (= ~t1_pc~0 1) .cse1 .cse2 .cse17 .cse9 .cse18 .cse8 .cse10))) (.cse7 (<= ~local~0 ~token~0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (<= ~token~0 .cse19)) (.cse15 (<= .cse19 ~token~0)) (.cse12 (= 0 ~t2_st~0)) (.cse11 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse12 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10) (and .cse14 .cse15 .cse12 .cse16 .cse13) (and .cse0 .cse2 .cse17 .cse5 .cse7 .cse18 .cse10 .cse9 .cse8 .cse11) (and .cse12 .cse5 .cse16 .cse7 .cse13) (and .cse14 .cse15 .cse1 .cse12 .cse2 .cse17 .cse18 .cse10 .cse9 .cse8 .cse11))))) [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-5(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-6(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-8(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-9(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-11(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-12(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-14(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-15(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L196-17(lines 196 205) no Hoare annotation was computed. [2020-12-09 13:46:01,750 INFO L262 CegarLoopResult]: For program point L197(lines 197 202) no Hoare annotation was computed. [2020-12-09 13:46:01,751 INFO L262 CegarLoopResult]: For program point L197-1(lines 197 202) no Hoare annotation was computed. [2020-12-09 13:46:01,751 INFO L262 CegarLoopResult]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2020-12-09 13:46:01,751 INFO L262 CegarLoopResult]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2020-12-09 13:46:01,751 INFO L262 CegarLoopResult]: For program point L197-4(lines 197 202) no Hoare annotation was computed. [2020-12-09 13:46:01,751 INFO L262 CegarLoopResult]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2020-12-09 13:46:01,751 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-09 13:46:01,751 INFO L258 CegarLoopResult]: At program point L297(lines 273 325) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse17 (+ ~local~0 1))) (let ((.cse5 (= 0 ~t2_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= ~t1_st~0 0)) (.cse9 (<= ~m_pc~0 0)) (.cse20 (<= ~token~0 .cse17)) (.cse22 (<= .cse17 ~token~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= 0 ~t2_st~0)) (.cse1 (= 2 ~t1_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_2~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse21 (not .cse3)) (.cse4 (= ~E_1~0 2)) (.cse12 (<= 2 ~E_M~0)) (.cse19 (= ~t2_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse5 .cse4 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~token~0 (+ ~local~0 2)) .cse16 .cse6 .cse14 (< .cse17 ~token~0) .cse0 .cse1 .cse18 .cse11 .cse4 .cse12 .cse19) (and .cse0 .cse13 .cse2 .cse5 .cse14 .cse7 .cse15 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse8 .cse18 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse16 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse4 .cse5 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse21 .cse4 .cse19 .cse16 .cse14 .cse15 .cse18 .cse10 .cse11 .cse12) (and .cse6 .cse7 .cse0 .cse8 .cse2 .cse18 .cse10 .cse21 .cse4 .cse5 .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse19 .cse16 .cse14 .cse7 .cse15 .cse9 .cse10 .cse11 .cse12) (and .cse20 .cse0 .cse1 .cse21 .cse4 .cse19 .cse22 .cse6 .cse7 .cse8 .cse18 .cse11 .cse12) (and .cse16 .cse6 .cse0 .cse1 .cse18 .cse11 .cse21 .cse4 .cse12 .cse19) (and .cse16 .cse6 .cse0 .cse2 .cse18 .cse10 .cse11 .cse21 .cse4 .cse12 .cse19)))) [2020-12-09 13:46:01,751 INFO L258 CegarLoopResult]: At program point L133-1(lines 121 152) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 0))) (let ((.cse0 (+ ~local~0 1)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse10 (= 0 ~t2_pc~0)) (.cse14 (= ~t1_st~0 0)) (.cse17 (<= ~m_pc~0 0)) (.cse15 (< 0 ~t2_st~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse1 (= ~t1_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ~E_1~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse9 (not .cse18))) (or (and (<= ~token~0 .cse0) (<= .cse0 ~token~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse11 .cse12 .cse10 .cse13 .cse2 .cse14 (= ~m_st~0 2) (= ~m_st~0 ~E_1~0) .cse5 .cse15 .cse16 .cse7 .cse8) (and (<= ~token~0 (+ ~local~0 2)) .cse1 .cse13 .cse3 (< .cse0 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse12 .cse17 .cse18 .cse16 .cse6 .cse10 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse5 .cse12 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse11 .cse12 .cse18 .cse6 .cse10 .cse13 .cse2 .cse14 .cse17 .cse15 .cse16 .cse7 .cse8) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-12-09 13:46:01,752 INFO L258 CegarLoopResult]: At program point L67(lines 41 80) the Hoare annotation is: (let ((.cse1 (<= ~t1_pc~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= 0 ~t2_st~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse9 (<= ~m_pc~0 0)) (.cse10 (<= ~local~0 ~token~0)) (.cse3 (= 0 ~t2_pc~0)) (.cse0 (<= 2 ~E_2~0)) (.cse15 (= 2 ~t1_st~0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~E_1~0 2)) (.cse16 (= ~t2_pc~0 1)) (.cse13 (= 2 ~t2_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse2 .cse9 .cse10 .cse5 .cse4 .cse11 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse16 .cse13 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse14 .cse0 .cse8 .cse15 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12) (and (<= ~token~0 (+ ~local~0 2)) .cse0 (< (+ ~local~0 1) ~token~0) .cse15 .cse4 .cse5 .cse16 .cse13 .cse14 .cse6 (= ~m_pc~0 1) .cse11 .cse12))) [2020-12-09 13:46:01,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:46:01 BoogieIcfgContainer [2020-12-09 13:46:01,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 13:46:01,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 13:46:01,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 13:46:01,804 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 13:46:01,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:45:52" (3/4) ... [2020-12-09 13:46:01,807 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 13:46:01,827 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 104 nodes and edges [2020-12-09 13:46:01,828 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2020-12-09 13:46:01,830 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-09 13:46:01,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 13:46:01,916 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8791a706-3d93-4d78-a271-b687471f49be/bin/utaipan/witness.graphml [2020-12-09 13:46:01,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 13:46:01,917 INFO L168 Benchmark]: Toolchain (without parser) took 11244.93 ms. Allocated memory was 123.7 MB in the beginning and 320.9 MB in the end (delta: 197.1 MB). Free memory was 82.8 MB in the beginning and 169.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 111.0 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:01,917 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 123.7 MB. Free memory is still 99.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 13:46:01,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.15 ms. Allocated memory is still 123.7 MB. Free memory was 82.6 MB in the beginning and 94.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:01,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.13 ms. Allocated memory is still 123.7 MB. Free memory was 94.4 MB in the beginning and 91.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:01,918 INFO L168 Benchmark]: Boogie Preprocessor took 30.95 ms. Allocated memory is still 123.7 MB. Free memory was 91.3 MB in the beginning and 88.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:01,918 INFO L168 Benchmark]: RCFGBuilder took 1100.93 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 88.7 MB in the beginning and 78.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:01,918 INFO L168 Benchmark]: TraceAbstraction took 9730.75 ms. Allocated memory was 148.9 MB in the beginning and 320.9 MB in the end (delta: 172.0 MB). Free memory was 78.8 MB in the beginning and 184.1 MB in the end (delta: -105.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:01,919 INFO L168 Benchmark]: Witness Printer took 112.42 ms. Allocated memory is still 320.9 MB. Free memory was 184.1 MB in the beginning and 169.0 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 13:46:01,920 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.12 ms. Allocated memory is still 123.7 MB. Free memory is still 99.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 220.15 ms. Allocated memory is still 123.7 MB. Free memory was 82.6 MB in the beginning and 94.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.13 ms. Allocated memory is still 123.7 MB. Free memory was 94.4 MB in the beginning and 91.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.95 ms. Allocated memory is still 123.7 MB. Free memory was 91.3 MB in the beginning and 88.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1100.93 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 88.7 MB in the beginning and 78.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9730.75 ms. Allocated memory was 148.9 MB in the beginning and 320.9 MB in the end (delta: 172.0 MB). Free memory was 78.8 MB in the beginning and 184.1 MB in the end (delta: -105.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 16.1 GB. * Witness Printer took 112.42 ms. Allocated memory is still 320.9 MB. Free memory was 184.1 MB in the beginning and 169.0 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((token <= local + 1 && 0 < t1_st) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) || ((((((((((((token <= local + 1 && 0 < t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 0 < t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((token <= local + 2 && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && local + 1 < token) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || ((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && local <= token) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || (((((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && 2 == t1_st) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((2 == t2_st && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && t1_pc <= 0) && token <= local) && local <= token) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || ((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || (((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && token <= local) && m_pc <= 0) && local <= token) && E_1 == 2) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && 2 <= E_2) && 0 == t2_st) && 2 == t1_st) && token <= local) && m_pc <= 0) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 2 && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((2 == t2_st && 2 <= E_2) && 0 < t1_st) && t1_pc <= 0) && m_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || ((((((((((((2 <= E_2 && 0 < t1_st) && token <= local) && E_1 == 2) && 0 == t2_pc) && !(m_st == 0)) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 0 < t1_st) && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 0 < t1_st) && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 0 < t1_st) && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 0 < t1_st) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1)) || ((((((((((((2 <= E_2 && 0 < t1_st) && token <= local) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || (((((((((((token <= local + 2 && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((((((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && 0 == t2_pc) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && m_pc == 1) && 0 < t2_st) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((token <= local + 2 && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && 0 == t2_pc)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 < t2_st) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((t1_pc == 1 && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || ((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && t2_pc == 1) || (((((((((((token <= local + 2 && t1_pc == 1) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && t2_pc == 1)) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && t2_pc == 1)) || ((((((((((token <= local + 2 && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((token <= local + 1 && 0 < t1_st) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && local + 1 <= token) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) || ((((((((((((token <= local + 1 && 0 < t1_st) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 0 < t1_st) && E_1 == 2) && 0 == t2_pc) && !(m_st == 0)) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && 0 < t2_st) && !(tmp == 0)) && 2 <= E_M - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && token <= local) && local <= token) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || (((((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && 2 == t1_st) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((2 == t2_st && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && t1_pc <= 0) && token <= local) && local <= token) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && 2 <= E_M) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((__retres1 == 0 && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && 0 == t2_pc) && E_1 == 2) && 2 <= E_M - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && 0 == t2_pc) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && 0 == t2_pc) && E_1 == 2) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && 0 == t2_st) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((token <= local + 2 && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && local + 1 < token) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && 0 == t2_pc) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_st == 2) && m_st == E_1) && 0 == t2_st) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && 2 == t1_st) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && t1_st == 0) && m_pc == 1) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && 0 == t2_st) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && m_st == 0) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || ((((((((((((token <= local + 1 && 2 <= E_2) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M)) || (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1)) || ((((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((((((2 == t2_st && __retres1 == 0) && 2 <= E_2) && 0 < t1_st) && m_pc <= 0) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) && t2_pc == 1) || (((((((((((__retres1 == 0 && 2 <= E_2) && 0 == t2_st) && 0 < t1_st) && token <= local) && m_pc <= 0) && m_st == 0) && local <= token) && E_1 == 2) && 0 == t2_pc) && !(tmp == 0)) && 2 <= E_M)) || ((((token <= local + 1 && local + 1 <= token) && 0 == t2_st) && (((((((__retres1 == 0 && m_st == E_1) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) || (((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M))) && 0 == t2_pc)) || (((((((((2 == t2_st && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1)) || ((((0 == t2_st && token <= local) && (((((((__retres1 == 0 && m_st == E_1) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) || (((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_2) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M))) && local <= token) && 0 == t2_pc)) || ((((((((((token <= local + 1 && local + 1 <= token) && __retres1 == 0) && 0 == t2_st) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && 2 <= E_M) && __retres1 == 0) && !(m_st == 0)) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && __retres1 == 0) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || (((((((((((token <= local + 2 && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && m_pc == 1) && (E_M == 1 || 2 <= E_M)) && 0 < t2_st) && !(tmp == 0)) && E_1 == 2) && t2_pc == 1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && m_pc == 1) && token <= local) && local <= token) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) || ((((((((2 == t2_st && t1_pc == 1) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && 2 <= E_M) && E_1 == 2) && !(m_st == 0)) && t2_pc == 1) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && E_2 == 1) && 0 == t2_st) && m_pc == 1) && 0 == t2_pc) && !(m_st == 0)) && E_1 == 2) && !(tmp == 0)) && 2 <= E_M) || (E_2 == 1 && (((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && !(__retres1 == 0)) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || ((((((((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && 0 == t2_st) && m_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1))) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((token <= local + 2 && 2 <= E_2) && local + 1 < token) && 2 == t1_st) && !(m_st == 0)) && E_1 == 2) && t2_pc == 1) && 2 == t2_st) && t1_pc == 1) && __retres1 == 0) && m_pc == 1) && !(tmp == 0)) && 2 <= E_M - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && local <= token) && __retres1 == 0) && !(tmp == 0)) && 2 <= E_M) && !(m_st == 0)) && t2_pc == 1) || (((((((((t1_pc == 1 && __retres1 == 0) && 0 == t2_st) && 2 <= E_2) && token <= local) && local <= token) && !(tmp == 0)) && 0 == t2_pc) && !(m_st == 0)) && 2 <= E_M)) || ((((((((((((2 <= E_2 && t1_pc <= 0) && token <= local) && __retres1 == 0) && !(m_st == 0)) && t2_pc == 1) && 2 == t2_st) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && local <= token) && !(tmp == 0)) && 2 <= E_M)) || (((((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && 0 == t2_st) && t1_pc <= 0) && token <= local) && local <= token) && 0 == t2_pc) && !(m_st == 0)) && !(tmp == 0)) && 2 <= E_M) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && 2 <= E_2) && token <= local) && m_pc == 1) && local <= token) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) || (((((((((((2 == t2_st && t1_pc == 1) && __retres1 == 0) && __retres1 == 0) && 2 <= E_2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && t2_pc == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 23, TraceHistogramMax: 4, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3520 SDtfs, 3617 SDslu, 3722 SDs, 0 SdLazy, 733 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 630 GetRequests, 551 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1161occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 1295 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 192 NumberOfFragments, 4649 HoareAnnotationTreeSize, 33 FomulaSimplifications, 32156 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 33 FomulaSimplificationsInter, 10240 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1622 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 238260 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1217 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 502/510 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 correct! Received shutdown request...